Partition Equal Subset Sum

Question Explain

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. This is a 0/1 Knapsack problem variant.