Partition Equal Subset Sum

MediumArrayBacktracking

Description

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.

Examples

Input:nums = [1,5,11,5]
Output:true
Explanation:

The array can be partitioned as [1, 5, 5] and [11].

Input:nums = [1,2,3,5]
Output:false
Explanation:

The array cannot be partitioned into equal sum subsets.

Input:nums = [1,1]
Output:true
Explanation:

With nums = [1,1], the subsequence/subset condition is met.

Constraints

  • 1 ≤ nums.length ≤ 200
  • 1 ≤ nums[i] ≤ 100

Ready to solve this problem?

Practice solo or challenge other developers in a real-time coding battle!