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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.