Flipkart | SDE-1 | 2024 batch | Interview Experience
Summary
I successfully interviewed for an SDE-1 role at Flipkart, navigating through multiple technical rounds focused on data structures and algorithms, followed by a managerial discussion, ultimately securing an offer.
Full Experience
I initiated my application for the SDE-1 position at Flipkart through a form circulated by their HR on LinkedIn.
Round 1 (Online Test)
The first stage was an online test on the SHL platform, lasting 90 minutes. It comprised three coding questions, primarily focusing on graph and dynamic programming problems. I passed this round and received a selection email after about 10 days, with the subsequent technical rounds scheduled shortly thereafter.
Round 2 (PS/DS Round)
This round involved two problem-solving questions. I managed to solve both, dedicating about 15-20 minutes to the first and around 30 minutes to the second. I received confirmation of clearing this round on the same day, with Round 3 scheduled for the very next day.
Round 3 (PS/DS Round)
Three questions were posed in this round. For the first question, I spent considerable time articulating my thought process, moving from a brute-force solution to an optimized greedy approach. For the second, despite initially proposing a less optimal solution, the interviewer's supportive guidance led me to realize and implement a binary search approach, given the high constraints. The third question was a standard problem that I had practiced extensively, allowing me to directly present the optimized solution and complete it in just 10 minutes.
A few hours later, I received an email informing me that my Hiring Manager (HM) round would be on the same day, though it was later postponed to the next day due to some work emergencies.
Round 4 (HM Round)
The HM round lasted about 50 minutes. The discussion centered around my internships, my favorite projects, and several behavioral questions.
Approximately five days after the HM round, I received the good news of my selection.
Interview Questions (5)
Given an array of non-negative integers arr[], where arr[i] represents the maximum number of steps that can be made forward from that element, find the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then we cannot move through that element.
Preparation Tips
My primary advice for preparation is to diligently solve DSA questions from platforms like LeetCode. Always practice moving from a brute-force solution to an optimized one, and crucially, continuously communicate your approach during the interview. For the managerial round, ensure you thoroughly review your projects and internships to discuss them effectively.