# Course Schedule II: Study Guide
Course Schedule II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The same Kahn/topo sort, but also record the order nodes are peeled; if you peel fewer than n courses, return an empty list.
## 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
Returning any DFS finishing order without proving the graph is a DAG.
## 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 AI coding interview assistant.