Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2740. Find the Value of the Partition
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.
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.