Flipkart Interview Experience for SDE-2

Round 1:

1. Matrix which  has value to move in all directions .  Can we reach the destination from the starting point.

2. Keep track of K largest files  files in the  file system all the time. Whats the complexity of deleting the largest file.There was lot of emphasis/discussion on the complexities of the solution and each action in the solution and if it can be done better.

Round 2:

https://www.interviewbit.com/problems/gas-station/

Even though I gave the most optimal solution, interview is not at all convinced. I have to tried a lot prove that my logic works and at the ens I even used some maths equations to explain to him.But some how he is not willing to accept.

2. Implement hasNext() and getNextInteger() for a data structure which is similar to this [[1][[3][34]]]

Round 3:

Machine Coding round over hangouts

Cab Management portal which serves in multiple cities. You should be able to request for a cab (most idle) in any city. Assign cab to a different city .Maintain state of the Cab . History of the Cab activity .

Admin and user roles and the methods that are specific to these roles. It needs to be code in 90 mins on any IDE .

My Personal Notes arrow_drop_up

Save