Partition to K Equal Sum Subsets
Medium
Bitmask DP
Print true if the array can be divided into k non-empty subsets with equal sums, otherwise false.
Constraints
1 <= k <= n <= 16 1 <= nums[i] <= 10^4
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.