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

# SDE - Intern

Flipkart
1 rounds | 2 Coding problems

## Interview preparation journey

Preparation
Duration: 8 months
Topics: DBMS, OS, SQL, graphs, binary search, pointers, linked list, avl trees, queues and stacks, etc
Tip

Tip 1 : Your basics should be very clear about data structures and algorithms.
Tip 2 : Try to solve questions in a specific time frame. Also dry run your code with custom test cases, try to find the edge cases.
Apart from this try analyzing the time and space complexity of your solution.
Tip 3 : Take a look at editorials after solving the questions as it can give you a better approach to the problem.
Tip 4 : Don't neglect subjects like OOP's, DBMS and OS. Interviews ask few questions from here as well.

Application process
Where: Campus
Eligibility: above 7.5 cgpa, all branches
Resume tip

Tip 1 : not too short or too long
Tip 2 : scale up the basic technologies in resume

## Interview rounds

01
Round
Hard
Online Coding Interview
Duration75 minutes
Interview date12 Oct 2020
Coding problem2

Round was scheduled in the evening within a window of two hours.

Moderate
15m average time
85% success
0/80

##### For example:
``````The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
``````
``````Can you solve this problem in O(N) time and O(1) space complexity?
``````

### 2. Minimum steps to reach target by a Knight

Moderate
25m average time
60% success
0/80

#### Your task is to find out the minimum steps a Knight will take to reach the target position.

##### Example:
``````knightPosition: {3,4}
targetPosition: {2,1}
``````

``````The knight can move from position (3,4) to positions (1,3), (2,2) and (4,2). Position (4,2) is selected and the ‘stepCount’ becomes 1. From position (4,2), the knight can directly jump to the position (2,1) which is the target point and ‘stepCount’ becomes 2 which is the final answer.
``````

#### Note:

``````1. The coordinates are 1 indexed. So, the bottom left square is (1,1) and the top right square is (N, N).

2. The knight can make 8 possible moves as given in figure 1.

3. A Knight moves 2 squares in one direction and 1 square in the perpendicular direction (or vice-versa).
``````

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

What does ROLLBACK do in DBMS?

Start a Discussion
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
1449 views
SDE - Intern
3 rounds | 7 problems
Interviewed by Flipkart
998 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Flipkart
1627 views
SDE - Intern
3 rounds | 4 problems
Interviewed by Flipkart
733 views
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13227 views