SDE-intern applicants have rated the interview process at Flipkart with 2 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 56.7% positive. This is according to Glassdoor user ratings.
Candidates applying for SDE-intern roles take an average of 20 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Flipkart overall takes an average of 17 days.
Here are the most commonly searched roles for interview reports -
Three rounds each eliminatory:
1) MCQ test - cs fundamentals and aptitude based questions
2) first interview round - 2 questions: array(easy to medium) and sorting
3) second interview round-2 questions : array(medium to hard) and tree(easy to medium)
Interview questions [1]
Question 1
first interview round - 2 questions: array(easy to medium) and sorting
second interview round-2 questions : array(medium to hard) and
tree(easy to medium)
The interview is mainly DSA based. You need to have good knowledge of various data structures. Your projects and development work doesn't matter much. If you have good cgpa it will be beneficial for you.
I applied through college or university. The process took 2 weeks. I interviewed at Flipkart (Bengaluru) in Oct 2023
Interview
I had 2 technical interview rounds. The questions asked were of Easy-Medium Level. The interviewers were great.
In my first round I was asked 3 DSA problems (1 Med , 2 Easy) I was able to solve all 3 without any hints in the most optimal complexities
Round 2
I was asked 2 DSA problems I spent a lot of time explaining the different approaches for the 1st question and coding it ( Took me 40 mins )
2nd Question was easy so I was able to explain and code it within 10 mins
Interview questions [1]
Question 1
Round 1.)
Q1.) Largest Subarray Length with equal number of 0's and 1's in a binary Array
Q2.) Next Greater Element
Q3.) Custom Question ( Easy )
Round 2.)
Q1.) Design a DS which performs insertion, deletion, searching and getRandom
Q2.) Minimum Sum of deleting exactly k elements elements can be deleted from front and back.