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$ nums[i] $\leq 2^{31} - 1$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in main.py in the following coding playground. We have provided some useful code templates in the other files that you may build on to solve this problem.