Flipkart | SDE-1 | offer

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

Summary

I successfully interviewed for an SDE-1 position at Flipkart and received an offer after completing multiple rounds covering coding, data structures, algorithms, and a hiring manager discussion.

Full Experience

I applied for the SDE-1 role at Flipkart through a form circulated by HR on LinkedIn. My interview process consisted of four rounds.

Round 1: Online Test

This round was conducted on the SHL platform and lasted 90 minutes. It featured three coding questions, all based on graph and dynamic programming concepts. I received a selection mail after about 10 days, and it took another 10-12 days for the first interview round to be scheduled.

Round 2: Problem Solving/Data Structures

This round had two specific coding questions. I solved the Symmetric Tree problem in about 15-20 minutes and the Maximal Square problem in approximately 30 minutes. I received an email on the same day informing me that I had cleared this round, and Round 3 was scheduled for the very next day.

Round 3: Problem Solving/Data Structures

This round was tougher than the previous one and involved three questions. I spent a considerable amount of time discussing approaches for Minimum Number of Jumps to Reach End of an Array, moving from brute force to an optimized greedy solution. For Finding Square Root of a Number up to Given Precision Using Binary Search, the constraints were very high (n up to 1018). Initially, I gave a normal solution, but with the interviewer's supportive guidance, I realized binary search was the optimal approach and successfully solved it. The third question was Sliding Window Maximum, a standard problem I've solved many times. I was asked to provide the optimized approach directly and completed it in just 10 minutes.

After a few hours, I received an email about an upcoming HM round on the same day, which was then postponed due to some work emergencies and happened the next day.

Round 4: Hiring Manager (HM) Round

This round lasted about 50 minutes. I was asked a variety of questions related to my internships, my favorite projects, and many behavioral questions. I focused on discussing my past experiences and projects in detail.

After five days, I received the mail confirming my selection for the SDE-1 position.

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
Data Structures & AlgorithmsHard

Given an array of non-negative integers nums where nums[i] represents the maximum number of steps that can be made forward from index i. Find the minimum number of jumps to reach the end of the array, starting from the first element.

Q4
Square Root with Given Precision (Binary Search)
Data Structures & AlgorithmsHard

Implement a function to compute the square root of a non-negative integer n up to a given precision. The problem had high constraints, with n up to 1018, strongly hinting at a binary search solution.

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. Return the max sliding window.

Preparation Tips

My preparation involved solving medium and hard-level DSA questions on LeetCode. I focused on explaining solutions from brute force to optimized approaches and continuously communicating my thought process. For the managerial round, I made sure to thoroughly review my 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!