# 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

Standard topological sort: build the prereq graph, Kahn-peel indegree-zero courses, and record the order. If you cannot peel all n courses there is a cycle and you 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 (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(V+E).

## Common mistake

DFS without a cycle color (visiting vs done), which can miss a back edge and emit an illegal order.

## 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 best AI tool for coding tests and OAs.