# Course Schedule IV: Walkthrough
Course Schedule IV shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The queries ask whether u is a prerequisite of v. DFS/BFS from each course on the prereq DAG (or Floyd-Warshall / bitsets, since n is small) to materialize reachability, then answer each query in O(1).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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(n(n+e) + q) or O(n^3 + q).
## Common mistake
Only checking a direct edge u->v and missing a longer prereq chain.
## 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 the Linkjob AI app.