Flipkart | SDE-1 | India | June 2024

flipkart logo
flipkart
SDE-1IndiaRejected
July 7, 20240 reads

Summary

I recently interviewed for an SDE-1 position at Flipkart in June 2024, which included an online assessment, two problem-solving rounds, and a hiring manager round. Despite putting in a good effort, I was ultimately rejected after the process, learning valuable lessons from the experience.

Full Experience

I recently had an interview opportunity at Flipkart for an SDE-1 role after filling out a Google form and being shortlisted for the online assessment.

Online Assessment (June 16th, 2024 - SHL Platform)

The online assessment consisted of three DSA (Data Structures and Algorithms) questions, all at a LeetCode Medium-Hard difficulty level. I was only able to solve two questions completely.

  1. A Graph-based problem, which was similar to Reconstruct Itinerary.
  2. Another problem, Create Maximum Number.
  3. A Tree-based problem (I don't recall the specifics).

Technical Interviews (June 20th, 2024)

I received an email on June 19th inviting me to the next round of interviews, which took place the very next day. There were three interviews in total:

Round 1: Problem Solving and Data Structures (PSDS) — 60 minutes

This round started with introductions. The interviewer asked about my favorite data structure, and I mentioned LinkedList, explaining why. They then provided a Google Doc link with two problems:

  1. A linked list problem similar to Reverse Linked List II, but instead of positions, two unique node values were given to define the sublist to be reversed. I spent a good 30-40 minutes on this, coding it completely on Google Docs and dry-running it with 2-3 examples.
  2. Gas Station. For the second question, I had limited time. I explained my initial thoughts and suggested a greedy approach, which the interviewer acknowledged was on the right track and didn't ask me to code.

The interview concluded with me asking a few questions.

Round 2: PSDS Round 2 (60 minutes)

This round felt relatively easier compared to the first one. I managed to solve both coding questions with correct approaches and discussed multiple solutions along with their time complexities. One was a DFS/DP-based problem, and the other was a Two Pointers/DP solution to find the total number of good subarrays under some condition (which I unfortunately forgot).

With some time remaining, the interviewer asked theoretical questions about graphs. We then had a good discussion about Flipkart, their team, technologies, and the challenges they face. There were two interviewers present, with one observing, and I also had a good discussion with the observer at the end.

Round 3: Hiring Manager (HM) Round (45 min)

The interview began with introductions; the Hiring Manager shared a detailed introduction about himself, his experience at Flipkart, the technology used, and his team. I then gave a brief introduction about myself.

The interviewer shared a Google Doc link for a design problem: Design a calculator with basic functionalities (addition, subtraction, multiplication, division) that can store the last five operations and allow users to modify any stored operation. We discussed suitable data structures for this task, considering different options like doubly linked lists, vectors, and ultimately settling on a deque. We had an in-depth discussion about the challenges associated with each data structure choice (e.g., why a vector might not work). I then coded the solution using an object-oriented approach, and the interviewer was satisfied.

Next, we discussed a project I had worked on. I demonstrated my deployed project, which seemed to impress the HM, and he requested to see the code. I explained my approach, leading to a good conversation of over 20 minutes. We then moved on to another project.

Finally, we discussed HR-based questions, including achievements, moments of pride, instances of failure, and my internship experience (or lack thereof), particularly how I managed college requirements without an internship. This round was quite long, lasting about 1 hour and 20 minutes.

Conclusion

I was ultimately rejected. I believe my chances were likely fewer because I felt I messed up in the last round. It was scheduled so quickly, and I found it challenging to adjust, so things didn't go according to plan. However, I learned a lot from the HM round, even if the first two felt more straightforward. While the last round was a challenging experience, it highlighted areas for improvement, particularly in my soft skills.

Interview Questions (6)

Q1
Reconstruct Itinerary
Data Structures & AlgorithmsHard

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from 'JFK'. Thus, the itinerary must begin with 'JFK'.

Q2
Create Maximum Number
Data Structures & AlgorithmsHard

Given two arrays of digits 'nums1' and 'nums2' of length 'm' and 'n' respectively, return the maximum number that can be formed by merging the two arrays. The length of the new number must be 'k' where 'k <= m + n'. The relative order of digits in the original arrays must be preserved.

Q3
Reverse Sublist by Node Values (Modified Reverse Linked List II)
Data Structures & AlgorithmsMedium

Given a singly linked list, instead of integer positions (like 'left' and 'right'), two unique node values are given. Reverse the sublist of the linked list between these two node values. All values in the linked list are unique.

Q4
Gas Station
Data Structures & AlgorithmsMedium

There are 'N' gas stations along a circular route, where the amount of gas at station 'i' is 'gas[i]'. You have a car with an unlimited gas tank and it costs 'cost[i]' of gas to travel from station 'i' to its next station (i+1). You begin the journey with an empty tank at one of the gas stations. Return the starting gas station's index if you can travel around the circuit once in the clockwise direction, otherwise return -1.

Q5
Design a Calculator with History and Edit Functionality
System Design

Design a calculator with basic functionalities (addition, subtraction, multiplication, division) that can store the last five operations and allow users to modify any stored operation.

Q6
Behavioral Questions
Behavioral
  • Discuss achievements and moments of pride in your career/academic journey.
  • Share instances of failure and what you learned from them.
  • Explain your internship experience (or lack thereof) and how you handled academic requirements related to internships.

Preparation Tips

Based on my experience, here are some key takeaways for preparation:

  • Always speak your mind during interviews, even if you think it might be wrong. Interviewers are there to help guide you. For example, in my first round, I was thinking about a graph solution for the second question, but the interviewer stopped me and hinted that there weren't multiple paths.
  • It's perfectly fine to ask for time to think or frame your answer instead of staying silent. I always ask for a moment to gather my thoughts.
  • The HR/HM rounds are not easy; prepare beforehand for common HR questions and be ready to discuss your projects in depth.
Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!