# Sliding Window Median: Walkthrough

Sliding Window Median shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Keep two heaps (max for the low half, min for the high half) and lazy-delete outgoing elements as the window slides.

## 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 answer, sliding window, stack, or in-place rewrite) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n).

## Common mistake

Forgetting lazy deletion lets stale values become the median.

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