Incture Technologies interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Incture Technologies

3 rounds | 3 Coding problems

Mansi

Experienced | Mar 2022

Rejected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Do at least 1 Project, projects are very necessary as it engages you with the interviewer.
Tip 2 : Practice at least 200 questions(Moderate to easy)
Tip 3 : Practice some Puzzles( You can go through Puzzle section from GFG, it's sufficient)

Application process

Where: Campus

Eligibility: No criteria

Resume tip

Tip 1 : Have some projects on resume, and know everything of your projects
Tip 2 : organize your resume properly use good template while building your resume

Interview rounds

Round

Easy

Coding Test - Pen and paper

Duration30 min

Interview date8 Mar 2022

Coding problem1

- Morning time
- Environment was good.
- No
- Interviewer was good

1. System Design Question

Design a solution so that Overcrowding in different coaches in the new metro rail service is reduced.

Problem approach

My Approach
While answering this round, you can have the following points in your answer, because they prefer this format. And try to right in points, avoid essays.

1. Problem statement
2. Solution
3. Flowchart
4. Summary
5. Conclusion
You can answer on pen and paper or word document or PowerPoint. It is totally up to you. But, they prefer the digital format.

Round

Medium

Video Call

Duration30 min

Interview date11 May 2022

Coding problem1

Interviewer was nice
interview happened at 7 pm
Firstly interviewer asked me to introduce myself
Then, we had some discussion on the system design round.
Then, we had some discussion on the project that i have done.
Then, he asked me question related to OOPS(Basic questions)
Then he game me these 2 problem to solve.

1. Nth Fibonacci Number

Easy

0/40

Asked in companies

The n-th term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -

    F(n) = F(n - 1) + F(n - 2), 
    Where, F(1) = 1, F(2) = 1

Provided 'n' you have to find out the n-th Fibonacci Number. Handle edges cases like when 'n' = 1 or 'n' = 2 by using conditionals like if else and return what's expected.

"Indexing is start from 1"

Example :

Input: 6

Output: 8

Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:    
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.

Problem approach

s1- Fibonacci series generates the subsequent number by adding two previous numbers. Fibonacci series starts from two numbers − F0 & F1. The initial values of F0 & F1 can be taken 0, 1 or 1, 1 respectively.

s2- Fibonacci series satisfies the following conditions −

Fn = Fn-1 + Fn-2
s3- Hence, a Fibonacci series can look like this −

F8 = 0 1 1 2 3 5 8 13

or, this −

s4- F8 = 1 1 2 3 5 8 13 21

Try solving now

Round

Hard

Group Discussion

Duration30 min

Interview date14 Jun 2022

Coding problem1

- Morning time
- Environment was good.
- No
- Interviewer was good

1. Why should you be hired?

It was kind of an HR round and also a final meet round. All 15 of us were asked to join the same meeting at the same time.

They told us that they can only hire 10 of the 15. So, we were given 30 seconds each and were asked why should we be hired, but they were impressed by all 15 of us so we all got selected and luckily, i was one of them.