Partition Equal Subset Sum
Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal, or false otherwise.
Example 1
Input
nums = [1,5,11,5]Output
trueThe array can be partitioned as [1, 5, 5] and [11].
Example 2
Input
nums = [1,2,3,5]Output
falseThe array cannot be partitioned into equal sum subsets.
Constraints
- 1 <= nums.length <= 200
- 1 <= nums[i] <= 100
Asked at 15 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.