Flipkart | SDE-1

flipkart logo
flipkart
sde-1Offer
July 6, 20240 reads

Summary

I successfully navigated multiple rounds of interviews at Flipkart for an SDE-1 role, ultimately receiving an offer. The process included an online coding test, multiple problem-solving and data structures rounds, and a final hiring manager discussion.

Full Experience

I applied for the SDE-1 role at Flipkart through a form shared by HR on LinkedIn. My journey started with an online test, followed by several interview rounds.

Round-1 (Online Test):
This round, conducted on the SHL platform, consisted of three coding questions that were heavily based on graph and dynamic programming concepts. I had 90 minutes to complete them.

Round-2 (PS/DS Round):
After about 10-12 days, I received an email confirming my selection for the next round. This round, held the very next day, involved two specific coding problems. I managed to solve Symmetric Tree in about 15-20 minutes and Maximal Square in approximately 30 minutes.

Round-3 (PS/DS Round):
I got mail that I had cleared Round 1 and 2 on the same day, and Round 3 was scheduled for the following day. This round felt a bit tougher than the previous one, and three questions were asked. The first was Minimum Number of Jumps to Reach End of a Given Array, which took me a considerable amount of time as I discussed approaches from brute force to an optimized greedy solution. Next, I faced Find Square Root of a Number Upto Given Precision using Binary Search. The constraints were high (n was 10^18), and while I initially gave a normal solution, the interviewer was very supportive and helped me realize binary search was the optimal approach, which I then solved. The last question was Sliding Window Maximum, a standard problem I've solved many times. I was asked to directly provide the optimized approach, which I did in just 10 minutes.

Round-4 (HM Round):
A few hours later, I received an email for the Hiring Manager round, which was initially scheduled for the same day but got postponed to the next due to some work emergencies. This round lasted about 50 minutes and focused heavily on my internships, my favorite projects, and various behavioral questions.

Five days after the HM round, I received the exciting news of my selection!

Interview Questions (5)

Q1
Symmetric Tree
Data Structures & AlgorithmsEasy

Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).

Q2
Maximal Square
Data Structures & AlgorithmsMedium

Given an m x n binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.

Q3
Minimum Number of Jumps to Reach End of a Given Array
Data Structures & AlgorithmsMedium

Given an array of integers where each element represents the maximum number of steps that can be made forward from that element. Write a function to return the minimum number of jumps to reach the end of the array (starting from the first element).

Q4
Square Root with Precision using Binary Search
Data Structures & AlgorithmsMedium

I was asked to find the square root of a number up to a given precision. The constraints were high, with N up to 10^18. I initially gave a normal solution, but the interviewer was very supportive and helped me realize that it would be solved using binary search, and I eventually solved it.

Q5
Sliding Window Maximum
Data Structures & AlgorithmsHard

You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the maximum sliding window.

Preparation Tips

My advice is to solve medium and hard-level DSA questions from LeetCode. Always go from brute force to an optimized approach, and communicate your thought process continuously. For the managerial round, thoroughly review your projects and internships.

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!