# Parallel Courses: Practice Notes

Parallel Courses 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 by semesters: each round peel every course whose indegree is now zero (you may take them all in parallel). The number of rounds is the answer; if any course remains, there is a cycle and you return -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(V+E).

## Common mistake

Returning the length of the longest chain without detecting a cycle, or taking only one course per semester.

## 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 help for online coding assessments.