# Parallel Courses II: Practice Notes
Parallel Courses II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Bitmask DP on the set of taken courses: from a mask, collect currently available courses (prereqs already taken) and try every subset of size up to k; dp[new] = dp[mask]+1.
## 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(3^n * n) if you iterate submasks carefully, or better with precomputed options.
## Common mistake
Greedy taking the k courses with most dependents, which is not optimal on this NP-ish n<=15 instance.
## 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 multilingual AI interview assistant.