[Leetcode] Partition Equal Subset Sum
Store boolean inside dp[].
Description
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.