Partition Equal Subset Sum
Return whether all entries of nums can be divided into two disjoint groups with equal sums, using every entry exactly once.
Example 1
nums = [1,5,11,5]trueExplanation
The single 11 balances 1+5+5.
Example 2
nums = [1,2,4]falseExplanation
Total 7 is odd, so equal integer halves are impossible.
Example 3
nums = [2,2,3,5]falseExplanation
Total 12 is even but no subset sums to 6.
Constraints
- 1 <= len(nums) <= 200
- Values are 1..100
Function contract
canPartitionArguments: jsonSolutionRuns on your device
Loading draft…
Run: 3 examples; Submit: 35 cases, on your device.
[1,5,11,5]