Back

Sunday common C++ interview problem: Partition an array into two to minimize the sum difference.

Given an array of integers with n*2 elements, partition the array into two partitions of size n such that their sums are as close as possible. Return the best achievable sum distance.

Assume n < 16.

Solve it yourself: https://compiler-explorer.com/z/9TY51KzEv
Solution: https://compiler-explorer.com/z/Ycs3vY4WK