Dynamic Programming
LC #416Medium
Partition Equal Subset Sum
Dynamic Programming
AmazonGoogleMetaProblem
Determine if an array can be partitioned into two subsets with equal sum.
arraydynamic-programming
Constraints
- ›1 ≤ n ≤ 200
- ›1 ≤ nums[i] ≤ 100
Example
Input
nums = [1, 5, 11, 5]Output
trueWhy
Sum=22, target=11. Subset [1,5,5]=11 and [11]=11