Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Difference Between Adjacent Elements in a Circular Array
Coding
- Maximum Number of Ways to Partition an Array
Coding
- Partition Array for Maximum Sum
Coding · Array · Dynamic Programming
- Partition Array for Maximum XOR and AND
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2294. Partition Array Such That Maximum Difference Is K
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source