Available question text
Partition the array into two nonempty subsets to minimize |max(nums1) - min(nums2)| — equivalently, find a cut that separates the array so the chosen max and min are as close as possible; the optimal value equals the minimum difference between adjacent elements in the sorted array.
Related questions
Continue with questions that share topics or the same question type.
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 2740. Find the Value of the Partition
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source