# Parallel Courses III: Practice Notes

Parallel Courses III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Kahn/topo DP: time[v] = duration[v] + max(time[u] over incoming u); the answer is the max over all nodes.

## 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

Summing durations along a single path and missing the max over predecessors.

## 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 https://www.linkjob.ai/.