33. Partition Equal Subset Sum
Medium•
Given a nonempty array of positive integers nums, return whether its elements can be split into two subsets with equal sums. Every element must belong to exactly one subset. Each array position can be used once; equal values at different positions are separate elements.
Return a boolean, not the subsets themselves. The original order does not matter, and the input must remain unchanged.
Example 1:
![The numbers [1,5,11,5] split into [1,5,5] and [11], each summing to 11.](/problems/partition-equal-subset-sum/example-1.svg)
Input: canPartition([1, 5, 11, 5])
Output: true
Explanation: One subset is [11]; the other is [1,5,5]. Both sum to 11.
Example 2:
Input: canPartition([1, 2, 3, 5])
Output: false
Explanation: The total is 11, so it cannot be split into two integer sums of equal size.
Example 3:
Input: canPartition([2])
Output: false
Explanation: The only positive element cannot form two equal-sum subsets.
Constraints
- 1 <= nums.length <= 200
- 1 <= nums[i] <= 100
Accepted2/2|Acceptance Rate100.0%