# Finding MK Average: Interview Notes

Finding MK Average shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A stream; after m elements the MKAverage is (sum of the last m, dropping the smallest k and largest k) / (m-2k). Keep a sliding window of m with a queue, plus three ordered multisets (low k, mid, high k) and the mid sum. On add/remove, rebalance so the three sets stay sized k / m-2k / 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(log m) per insert.

## Common mistake

Sorting the window every query (too slow) or dropping k from the whole stream instead of the last m.

## 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.