Leetcode 2035. Partition Array Into Two Arrays to Minimize Sum Difference

Partition the 2n integers into two equal-sized groups (choose n elements for one group) to minimize the absolute difference of their sums — a constrained subset-sum/combination optimization that is typically solved with a meet-in-the-middle approach given n ≤ 15.