You are given an integer array nums of length n and an integer k.

An inversion in a subarray is defined as a pair of indices $(i, j)$ such that $0 \leq i < j <$ k and the element at index $i$ is strictly greater than the element at index $j$.

Return the minimum number of inversions among all contiguous subarrays of length k.

Constraints:

• $1 \leq$ n $==$ nums.length $\leq 10^5$

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

• $1 \leq$ k $\leq$ n

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.