Topological Sort of Task Dependencies

Problem Overview

Given a map tasks where each key is a task name and its value is the list of tasks it depends on, return any valid order of the tasks: every task must come after all of its dependencies. The report describes it as almost the same as LeetCode Course Schedule,…

• 3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people