# Course Schedule: Interview Notes
Course Schedule shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build the prereq graph and run Kahn's algorithm (or a 3-color DFS); a leftover node with indegree > 0 means a cycle and you cannot finish.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(V+E).
## Common mistake
Only checking pairwise prereqs and missing a longer cycle A→B→C→A.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at linkjob.ai.