# Maximum Average Pass Ratio: Study Guide
Maximum Average Pass Ratio shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The gain of giving a class one extra student is (p+1)/(t+1) - p/t. Put every class in a max-heap by that gain and assign each extra student to the current best class, then push the updated gain back.
## 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+k) log n).
## Common mistake
Giving extras to the class with the worst current ratio, which is not the same as the largest marginal gain.
## 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 interview copilot app.