Given an integer array nums and an integer k, determine the total number of partitions of nums into contiguous non empty subarrays such that for every subarray, the difference between its maximum element and its minimum element is at most k.

Constraints:

• $2 \leq$ nums.length $\leq 5 imes 10^4$

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

• $0 \leq$ k $\leq 10^9$

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.