240. Partition Equal Subset Sum

MediumDynamic Programming

Given an integer array nums, return true if you can partition the array into two subsets such that the sum of elements in both subsets is equal.

Examples

Input: [1,5,11,5]

Output: true

Explanation: Public test case for Partition Equal Subset Sum

Constraints

  • 1 <= nums.length <= 200
  • 1 <= nums[i] <= 100
Loading...

Run checks all cases above. Submit evaluates all test cases.