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:


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 .

Write your Interview Experience or mail it to contribute@geeksforgeeks.org

My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.