Course Schedule / Prerequisites / Task Completion / Topological Sort

Problem Overview

You are given a list of courses (or tasks) with prerequisite/dependency relationships forming a directed graph. Core questions asked across variants include: (1) Can all courses/tasks be completed? (Cycle detection.) (2) If yes, return a valid ordering (topological sort) — or find the minimum task to execute first. (3) Given…

• 7 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