Partition Equal Subset Sum
Medium
1-D DP
•
Grind 75NeetCode 150
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.

Constraints:

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