321. Partition Equal Subset Sum

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

Example:
Input: nums = [1,5,11,5]
Output: True

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

Example 2:
Input: nums = [1,2,3,5]
Output: False

Run this challenge interactively in Python or JavaScript when the app loads.