Flipkart | SDE-1 | 2024 grad | Selected

flipkart logo
flipkart
SDE-1Offer
June 25, 20240 reads

Summary

I successfully interviewed for an SDE-1 position at Flipkart as a 2024 graduate, navigating through an online test, two problem-solving rounds, and a hiring manager round, ultimately receiving a selection offer.

Full Experience

I applied for the SDE-1 role at Flipkart through an HR form circulated on LinkedIn. My interview process began with an online test that comprised three coding questions. After a waiting period of about 10-12 days, I received a selection email, and my first Problem Solving/Data Structures (PS/DS) round was scheduled. In this round, I was asked two coding questions: Symmetric Tree and Maximal Square. I managed to solve Symmetric Tree in about 15-20 minutes and Maximal Square in approximately 30 minutes. Following this, I quickly moved to the next PS/DS round, which took place the very next day. This round involved three questions: Minimum Number of Jumps to Reach End of a Given Array, Find Square Root of Number Up to Given Precision Using Binary Search (where the interviewer helped guide me towards the binary search approach, given the high constraints), and Sliding Window Maximum. I received an email within a few hours confirming I had cleared this round and would proceed to the Hiring Manager (HM) round. This round was initially postponed due to work emergencies but happened the following day, lasting about 50 minutes. It heavily focused on my internships, my favorite projects, and numerous behavioral questions. Five days later, I received my selection email, confirming the offer.

Interview Questions (5)

Q1
Symmetric Tree
Data Structures & AlgorithmsMedium

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

Given an array of non-negative integers where arr[i] denotes the maximum number of steps that can be made from index i. The task is to find the minimum number of jumps to reach the end of the array (starting from the first element).

Q4
Find Square Root of Number Up to Given Precision Using Binary Search
Data Structures & AlgorithmsMedium

Given a non-negative number N and a precision P, find its square root up to P decimal places.

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 preparation primarily involved solving Data Structures and Algorithms (DSA) questions on LeetCode. I focused on understanding problems by first developing brute-force solutions and then optimizing them. Throughout my problem-solving, I made sure to communicate my thought process clearly. For the hiring manager round, I thoroughly reviewed my projects and internships to be prepared for related questions. I applied for this role through an HR form shared on LinkedIn.

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!