← Amazon questions

Topological Sorting

Filed under Amazon · Also reported at Flipkart, Morgan Stanley, Oracle

Given a directed graph representing tasks and their dependencies, return a valid linear ordering of tasks such that for every dependency U -> V, U comes before V.

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.