Given a directed graph representing tasks and dependencies, return a valid ordering of tasks to finish all dependencies (Topological Sort), and verify if a given ordering is valid.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.