Solution: Partition Equal Subset Sum
Explore the dynamic programming approach to solve the Partition Equal Subset Sum problem. Understand how to build and fill a lookup table to check if an array can be divided into two subsets with equal sums, optimizing both time and space complexity.
Statement
Given a non-empty array of positive integers, determine if the array can be divided into two subsets so that the sum of both subsets is equal.
Constraints:
-
nums.length -
nums[i]