Flipkart Interview Experience for SDE-1 (Off-Campus)

Hiring Process:
Online coding round-> Round 1 -> Round 2-> Round 3 (HM Round) -> Final Results.

Online Coding Round– 3 medium to tough problems

Interview Rounds:

Round 1:

This round was conducted online. The interviewer asked two DSA questions.

Problem 1: Define the structure of a Set that has three methods:
insert(x): This function takes an integer and inserts it into the set.
remove(x): This function takes an integer and removes it from the set.
getRandom(): This function returns a random element from the set, with the condition that the probability of returning elements should be the same.

All three methods were expected to have O(1) time complexity.

I implemented the structure using a vector and a hashMap.

Problem 2: Implement two functions, ‘makeRelation(char v1, int C, char v2)’ and ‘findRelation(char v1, char v2)’:

makeRelation(): This function creates a relation between two given variables and a constant: v1=C*v2
for Example : makeRelation(a,2,b) : a=2*b, makeRelation(b,3,c) : b=3*c, makeRelation(d,5,a) : d=5*a

findRelation(char v1, char v2): This function finds the relation between given two variables v1 and v2.
for Example : findRelation(d, c): d=30*c

I solved this problem using a graph.

Verdict: Selected

Round 2:

This round was also conducted online, and it took place on the next day after round 1. The interviewer asked two DSA questions.

Problem 1: A set of calls was given, each with a start time and end time. The task was to find the maximum number of calls that could be taken by customer support, along with the corresponding time period (using a greedy approach I successfully solved this problem).

Problem 2: A set of coins was given, and the goal was to find the minimum value that couldn’t be created using the given coins.
Example : coins: [1,1,2,6,8] -(Coins are always given in increasing order.)
1-> (1)
2-> (1+1) or (2)
1-> (1+2)
4-> (1+1+2)
5-> can not be made using the given coins.
Answer : 5

The expected time complexity was O(n), and the expected space complexity was O(1). This problem, although easy, had a tricky aspect. I successfully solved this problem as well.

Verdict: Selected

Round 3 (Hiring Manager Round):

This round was also conducted online and took place on the same day as round 2. It was the last round, led by the hiring manager. The manager began by asking me to introduce myself and then moved directly to a discussion about my internship project. We spent around 25 minutes talking about the project. Subsequently, he inquired about why I am leaving my current company after getting converted into full-time, why I chose Flipkart, any difficulties I had faced at my current company, and whether I had any conflicts with my peers or managers if yes how did you solve that. He also asked about my hobbies, strengths and weaknesses and notice period in the current company.

Verdict: Selected

Final Result: Selected