Partition Array Such That Maximum Difference Is K

Given an integer k and an integer array nums, you can partition nums into one or more subsequences such that each element in nums appears in exactly one of the subsequences.

Print the minimum number of subsequences needed such that the difference between the maximum and minimum values in each subsequence is at most k.