Solution: Sliding Window Median

Explore how to calculate the median in a sliding window of an integer array by applying the heaps pattern. Understand balancing max-heaps and min-heaps, leveraging a hash map to manage element removal, and improving time complexity from naive sorting to a logarithmic solution. This lesson guides you through efficient data handling for median calculations in coding interviews.

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$

...