 All Problems
Partition Equal Subset Sum
medium
array
dynamic programming
amazon
facebook

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:  1 5 11 5
Output: true

([1, 5, 5] and [11])

Example 2:

Input:  1 2 3 5
Output: false

Constraints:

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

Input format: Space-separated integers.

Output format: true or false.

Run to check your code against the sample cases, or submit to run every case