You are given an integer array nums and an integer k.

Consider every sliding window of size k moving from left to right across nums. For each window, find the length of the shortest continuous subarray that, if sorted in ascending order, makes the entire window sorted in ascending order. If a window is already sorted, the length is $0$.

Return an array of integers where each element corresponds to the minimum subarray length required to sort that respective window.

Constraints:

• $1 \leq$ nums.length $\leq 1000$

• $1 \leq$ k $\leq$ nums.length

• $1 \leq$ nums[i] $\leq 10^6$

Now, 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 the following coding playground.