# Maximum Average Subarray II: Practice Notes
Maximum Average Subarray II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Binary search the average mid, then check whether any subarray of length >= k has average >= mid by looking at prefix sums shifted by mid (min prefix so far of length at least k).
## 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 (max-min)/eps).
## Common mistake
Checking every length >= k window, which is O(n^2).
## 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 helper that uses your resume.