← Amazon questions

Partition array into two subsets with minimum sum difference

Filed under Amazon · Also reported at Amdocs

Given an array of non-negative integers, divide it into two subsets such that the absolute difference between their sums is minimized. Return the 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 Amazon questions

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