# Maximum Students Taking Exam: Interview Notes
Maximum Students Taking Exam shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Enumerate valid seat bitmasks per row (no two adjacent bits, and bits only on empty seats). DP row-by-row: a mask is compatible with the previous mask when no diagonal cheating bit is set; take the maximum popcount sum.
## 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 * 4^m) with m = columns <= 8.
## Common mistake
Placing a student in every empty seat, which ignores the adjacent and diagonal cheat rules.
## 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 Linkjob AI interview assistant.