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.