Given an integer array nums and an integer k, partition nums into the minimum number of subsequences such that each element in nums belongs to exactly one subsequence.

Return the minimum number of subsequences required such that the difference between the maximum value and the minimum value in every subsequence is at most k.

Note: A subsequence is a sequence that can be derived from an array by deleting zero or more elements without changing the relative order of the remaining elements.

Constraints:

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

• $0 \leq$ nums[i] $\leq 10^5$

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

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.