Flipkart limited interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Flipkart limited
3 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 Months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Interview rounds
01
Round
Easy
Online Coding Test
Duration40 Minutes
Interview date5 May 2021
Coding problem1
The online coding test is not that difficult. The questions are very easy. Only thing is that you have to come up with an efficient solution.The naive solutions are fairly obvious.
1. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
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.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
Using stack approach :
1) Store the nodes(values and address) in the stack until all the values are entered.
2) Once all entries are done, Update the Head pointer to the last location(i.e the last value).
3) Start popping the nodes(value and address) and store them in the same order until the stack is empty.
4) Update the next pointer of last Node in the stack by NULL.
02
Round
Easy
Online Coding Test
Duration50 Minutes
Interview date6 May 2021
Coding problem2
First question was very simple. I was asked for the solution first and then to write the code on paper and show it to him.Second question requires more time to think.
1. Circular Move
Easy
20m average time
80% success
0/40
Asked in companies
You have a robot currently standing at the origin (0, 0) of a two-dimensional grid and facing north direction. You are given a sequence of moves for the robot in the form of a string of size 'N'. You are required to find whether the path followed by the robot upon taking the moves is circular or not.
A sequence of moves is circular if and only if the robot ends up from where it initially started.
The sequence of moves contains only three types of moves.
'G': it means that the robot will move 1 unit in the direction it is facing.
'L': it means that the robot will move 90 degrees towards its left. For example, if the robot is facing north and it has to make an ‘L’ move, then it will start facing the west direction.
'R': it means the robot will move 90 degrees towards its right. For example, if the robot is facing north and it has to make an ‘R’ move then it will start facing the east direction.
Problem approach
The idea is to consider the starting position as (0, 0) and direction as East (We can pick any values for these). If after the given sequence of moves, we come back to (0, 0), then given sequence is circular, otherwise not.
2. K Closest Points To Origin
Moderate
25m average time
75% success
0/80
Asked in companies
Your house is located at the origin of a 2-D plane. You have 'N' neighbours who live at 'N' different points on the plane. You want to visit exactly 'K' different neighbours who live closest to your house, you are given a 2 - D matrix 'POINTS'. So, find out the coordinates of the neighbours you are going to visit. The answer is guaranteed to be unique.
Note:
The distance between two points on a plane is the Euclidean Distance.
For Example:
If N = 2, K = 1 and the points are {2,3}, {-1, 2}.
Then the distance of the first point from the origin is sqrt((2 - 0) ^ 2 + (3 - 0) ^ 2) = sqrt(13).
The distance of the second point from the origin is sqrt((-1 - 0) ^ 2 + (2 - 0) ^ 2) = sqrt(5).
Follow Up:
Can you solve this in O(N log K) time complexity?
Problem approach
1) Consider two points with coordinates as (x1, y1) and (x2, y2) respectively. The Euclidean distance between these two points will be:
√{(x2-x1)2 + (y2-y1)2}
2) Sort the points by distance using the Euclidean distance formula.
3) Select first K points form the list
4) Print the points obtained in any order.
03
Round
Easy
HR Round
Duration20 Minutes
Interview date7 May 2021
Coding problem0
The guy asking questions makes you feel relaxed. He will give you a feedback about the test and the questions asked in the test. I appreciated the feedback. He pointed out things i could have done better.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 10 problems
Interviewed by Flipkart limited
Selected 
2634 views
0 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Flipkart limited
Selected 1189 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Flipkart limited
Selected 1719 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Flipkart limited
Selected 2198 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes