# Two Heaps For A Running Median: Study Guide
Two Heaps For A Running Median shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Max-heap holds the lower half and min-heap the upper half; rebalance so sizes differ by at most one.
## 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 n) insert, O(1) median.
## Common mistake
Skipping the cross-check that the max of low is not greater than the min of high.
## 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.