Flipkart | SDE 2 | Backend | June 2024
- Result
- Ongoing
- Posted
- 6 Jul 2024
Summary
I interviewed for an SDE 2 Backend role at Flipkart in June 2024, completing several technical rounds including Machine Coding, Data Structures & Algorithms, and System Design, followed by a Hiring Manager discussion. I successfully cleared all interview stages and am currently awaiting a formal offer.
How it went
I received an email from a Flipkart recruiter on June 27th, asking about my availability for an SDE 2 interview on June 29th. Despite the short notice, I readily agreed, knowing the value of such an opportunity.
Round 1: Machine Coding Round - June 29th
This round involved all interviewees joining a single call. We were tasked with building a working console application. The Flipkart SDE 3 explained the problem and conducted a Q&A session from 9:30 AM to 10:00 AM, allowing us to clarify any doubts. We then had from 10:00 AM to 11:30 AM to build the application, remaining on the call throughout.
The core problem was to design a cache where a user could insert, fetch, and remove data. A key requirement was the ability to select the eviction policy at runtime. Examples of eviction policies provided included LRU (Least Recently Used) and TimeEviction. I successfully built a working application incorporating all the specified features.
Round 1.1: Machine Coding Evaluation - June 29th
Following the machine coding round, my code was evaluated. This session ran from 12:45 PM to 1:45 PM. I was asked to run my submitted code and explain my design approach. I had utilized the Strategy and Factory design patterns for the eviction policy feature, and I answered questions related to these patterns. The interviewer also asked me to demonstrate how I would add a new eviction policy to my existing design, aiming to assess the extensibility of my solution. I addressed all questions, and the interviewer seemed pleased with my design. Shortly after, I received a positive call from HR, confirming my progression.
Round 2: PSDS (DSA) - June 29th
This was a Data Structures and Algorithms round, scheduled from 2:30 PM to 3:30 PM, featuring two medium-level questions. The interviewer, an SDE 2 at Flipkart, was very supportive. The questions were:
- A Binary Tree problem, specifically Binary Tree Maximum Path Sum.
- A Binary Search problem, similar to Koko Eating Bananas.
I successfully answered both questions and received a call for the subsequent rounds.
Round 3: Design Round - June 30th
The design round, lasting from 12:20 PM to 1:20 PM, focused on a system design problem, covering both High-Level Design (HLD) and Low-Level Design (LLD). I was asked to design a URL shortener application and its API endpoints. The discussion also extended to designing for multiple data centers, scaling the database using sharding and partitioning, and improving system performance with technologies like Kafka, SQL vs. NoSQL considerations, and Redis. This round was satisfactory. The interviewer, a Principal Architect at Flipkart, primarily expected HLD discussions and related questions. I got a call for the HM round after this.
Round 4: HM Round - June 30th
My final round was with the Hiring Manager, from 2:00 PM to 3:00 PM, and was conducted by a Director of Engineering. This round focused on managerial and behavioral questions. I discussed my latest performance review, my favorite project I've worked on, and identified two people in my workplace whom I look up to. We also touched upon Flipkart's entry into quick commerce (the Zepto deal) and Walmart's acquisition of Flipkart. This round went well.
It's been almost six days since my last interview, and I haven't yet received a verbal offer from Flipkart. I've contacted HR twice, and each time I was told a recruiter would call by EOD, which hasn't happened. This concludes my interview experience for the Flipkart SDE 2 role.
Questions asked (8)
- 01
Design a Runtime Configurable Cache
System Design · Hard
Design a cache where a user can insert, fetch, remove data, and dynamically select the eviction policy at runtime. Eviction policies mentioned include LRU (Least Recently Used) and TimeEviction (based on a certain time duration).
- 02
Extend Cache Design with New Eviction Policy
System Design · Medium
Extend the previously designed cache system to add a new eviction policy, demonstrating the ease of integrating new features into the existing design. I discussed design patterns like Strategy and Factory.
- 03
Binary Tree Maximum Path Sum
Data Structures & Algorithms · Hard
Open the problemA path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most once. The path does not need to pass through the root. The path sum of a path is the sum of the node's values in the path. Given the
rootof a binary tree, return the maximum path sum of any non-empty path. - 04
Koko Eating Bananas (Similar)
Data Structures & Algorithms · Medium
Open the problemKoko loves to eat bananas. There are
npiles of bananas, thei-th pile haspiles[i]bananas. The guard has gone and will come back inhhours. Koko can decide her eating speed ofkbananas per hour. Each hour, she chooses some pile of bananas and eatskbananas from it. If the pile has less thankbananas, she eats all of them instead and will not eat any more bananas during this hour. Koko likes to eat slowly but still wants to finish eating all the bananas before the guard returns. Return the minimum integerksuch that she can eat all the bananas withinhhours. - 05
Design a URL Shortener
System Design · Hard
Design a URL shortener application, including API endpoints. The discussion also covered High-Level Design (HLD) and Low-Level Design (LLD).
- 06
Discuss Latest Performance Review
Behavioral
Discuss my latest performance review and its outcomes.
- 07
Favorite Project Discussion
Behavioral
Describe my favorite project I have worked on, including details and my role.
- 08
Role Models in Workplace
Behavioral
Identify and discuss two individuals in my workplace whom I look up to and why.