Solution: Sliding Window Median

Explore how to solve the sliding window median problem by applying a heaps-based approach. This lesson guides you through balancing max and min heaps, leveraging hash maps for efficient element removal, and understanding time and space complexity to deliver an optimized solution in Go.

We'll cover the following...

Statement
Solution
- Naive approach
- Optimized approach using heaps

Statement

Given an integer array, nums, and an integer, k, there is a sliding window of size k, which is moving from the very left to the very right of the array. We can only see the k numbers in the window. Each time the sliding window moves right by one position.

Given this scenario, return the median of the each window. Answers within $10^{-5}$ of the actual value will be accepted.

Constraints:

$1 \leq$ k $\leq$ nums.length $\leq 10^3$
$-2^{31} \leq$

...