Status: Fresher B.Tech from IIT/NIT

Interview Date: July 2021

I recently received an offer from Flipkart for the position of SDE-1 via their off campus recruitment drive via Flipkart Grid Hackathon.

No of Rounds - 4( Coding Test, 2 Technical Rounds and 1 Hiring Manager round)

Online Coding Round:
There were three questions to be done in 90 minutes.

I do not remember the exact questions, but they were along the lines of/variants of:

1. A variant of the Word Ladder problem.
   https://leetcode.com/problems/word-ladder/

2. Minimum number of refueling stops.
   https://leetcode.com/problems/minimum-number-of-refueling-stops/

3. A variant of the Merge Overlapping Intervals Problem.
   https://leetcode.com/problems/merge-intervals/

I was able to solve all 3 and proceeded to the interviews.

First Round: This was a round completely based on DSA and it lasted for just more than an hour.There were 3 questions and I was required to explain/dry run and code my solution in any programming language.Also, I was asked the time and space complexities.

1. A simple question based on strings. It was to check whether the string is a rotation of another string.
   https://leetcode.com/problems/rotate-string/
   Also, while discussing the solution , I mentioned the use of KMP algorithm. Hence, I was asked to dry run the algo for 2 strings.

2. Another string based question. The question was to find if it was possible to rearrange a string such that adjacent characters are d distance apart.If possible, then we have to print the string.

3. A simple binary tree question. It was to find all nodes that are distance K from given node
   https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/

Second Round: Again, it was a complete DSA round. 3 questions were asked. Again, we had to code, dry run and know the time and space complexities.

1. A binary tree question. It was to find the maximum sum such that no adjacent nodes are included.

2. Find minimum number of meeting rooms such that all meetings can be scheduled.

3. Find the no of subarrays with given sum. Discussed case of non-negative integers(Use of sliding window) and with negative numbers( Use of hashmap).
   https://leetcode.com/problems/subarray-sum-equals-k/

Hiring Manager Round: It was a round based on my previous internship and projects. We also had a thorough discussion on Hashing. Questions on linked list were asked along with a discussion on session tracking and cookies. There was a discussion on sorting algorithms and their time complexities. Also, questions like Why I want to join Flipkart and my best and worst qualities were asked.

After 2-3 days, I was informed of my selection.

P.S: Always try to tell your solution to the interviewer by thinking out loud. They will give hints and will help you to reach to the correct approach.