Amazon OA | SDE-1 | India
Anonymous User
586

Was supposed to do two questions in 105 minutes and also briefly explain the approach along with time complexity.

Q1- Reorder data in log files from leetcode

Q2- A very simple bfs problem to find shortest path from (0,0) to another destination grid given that some grids are marked as obstacles and we cannot pass through them.

I did both questions pretty fast. I attempted the test on saturday, any idea as of when i should be expecting to hear about next round from HR?

Comments (2)