← Goldman Sachs questions

Partition set into two subsets with minimum sum difference

Filed under Goldman Sachs

Given a set of N integers, divide it into two subsets such that the absolute difference between their subset sums is minimized. Return this minimum possible difference.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.