# Campus Bikes II: Study Guide
Campus Bikes 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 used bikes: dp[mask] is the min Manhattan cost to assign those bikes to the first popcount(mask) workers. Try giving the next worker each unused bike and take the cheapest.
## 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^2 * 2^n) with n = workers/bikes <= 10.
## Common mistake
Greedy closest-bike matching, which can steal a bike another worker needed much more.
## 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 interview copilot.