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.
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 [[]]
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 .
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.