Flipkart | SDE-1 | 2024 grad | June 2024

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

Summary

I successfully navigated through multiple rounds for a Flipkart SDE-1 position, involving coding and behavioral interviews, ultimately receiving an offer.

Full Experience

I initiated my application for the SDE-1 role at Flipkart through an HR-floated form on LinkedIn. The interview process consisted of four rounds.

Round-1 (Online Test)

This round comprised 3 coding questions, with a duration of 90 minutes, conducted on the SHL platform. All questions were based on graph and dynamic programming concepts. I cleared this round and received an email notification after 10 days.

Round-2 (PS/DS Round)

Approximately 10-12 days after the initial application, my first technical round was scheduled. I was asked two data structures and algorithms questions. I solved "Symmetric Tree" in about 15-20 minutes and "Maximal Square" in about 30 minutes. I received an email confirming my progression to the next round on the same day, with Round 3 scheduled for the following day.

Round-3 (PS/DS Round)

This round felt a bit tougher than the previous one, featuring three questions. I spent considerable time on "Minimum Number of Jumps to Reach End", detailing my thought process from a brute force approach to an optimized greedy solution. For "Square Root with Given Precision", where N was up to 10^18, the interviewer provided helpful hints, leading me to realize the binary search approach. The final question was "Sliding Window Maximum", which I had solved multiple times before. I was asked to provide an optimized solution directly and completed it in just 10 minutes. Within a few hours, I received a mail for the Hiring Manager round, which was initially scheduled for the same day but postponed to the next due to emergencies.

Round-4 (HM Round)

The Hiring Manager round lasted around 50 minutes. The discussion primarily revolved around my past internships, my favorite projects, and numerous behavioral questions.

Five days after this round, I received the selection mail.

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 & AlgorithmsMedium

Given an array of integers where each element represents the max 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 Given Precision
Data Structures & AlgorithmsMedium

Given an integer N, find its square root up to a given precision. The constraints were high, with N up to 10^18. I solved it using binary search with a hint from the interviewer.

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

Preparation Tips

For my preparation, I focused on solving medium and hard-level Data Structures and Algorithms (DSA) questions from LeetCode. My approach was to always start with a brute-force solution and then iteratively optimize it, continuously communicating my thought process throughout. For the managerial/HM round, I thoroughly reviewed my projects and internships, preparing to discuss them in detail.

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!