Search
⌘K
Get Premium
Leetcode 2294. Partition Array Such That Maximum Difference Is K
Partition the array into the minimum number of subsequences (each element used exactly once) so that in every subsequence the difference between its maximum and minimum is at most k. The core challenge is to group values into as few ranges of width ≤ k as possible under the subsequence assignment constraint (nums.length up to 1e5).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.