Given a non-empty array nums containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Input: nums = [1,5,11,5]
Explanation: The array can be partitioned as [1, 5, 5] and .
Input: nums = [1,2,3,5]
Explanation: The array cannot be partitioned into equal sum subsets.
#leetcode #cansum #medium