Minimum Subset Sum Difference
Medium
Partition & Subset-Sum DP
Split the array into two subsets so the absolute difference of their sums is minimal. Print that difference.
Constraints
1 <= n <= 100 1 <= a[i] <= 100
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.