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, and false otherwise.

---

Example 1

Input: nums = [1, 5, 11, 5]
Output: True
Explanation: The array can be split into [1, 5, 5] and [11], both with sum 11.

Example 2

Input: nums = [1, 2, 3, 5]
Output: False
Explanation: The total is 11 (odd), so no equal partition is possible.

---

Constraints

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