โ† Amazon questions

Find itinerary from tickets and Multi-source BFS

Filed under Amazon

Find an itinerary from a given list of tickets in O(N) time (or equivalent Eulerian path approach), and solve a multi-source BFS problem such as finding the minimum time to rot all oranges in a grid.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.