← Accenture questions

Partition set into two subsets with minimum difference

Filed under Accenture

Given an array of positive integers nums, partition the array into two subsets such that the absolute difference between the sums of the two subsets is minimized. Return this minimum non-negative…

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 Accenture questions

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