# High Five: Interview Notes
High Five shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each student has several scores; return each id with the average of that student's top five scores (integer division). Group by id (ordered map) and keep a min-heap of size 5 per student.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) 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 log n).
## Common mistake
Averaging all scores, or using floating-point averages when the judge wants truncation.
## 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 this tool.