Solution: Partition Equal Subset Sum
Understand how to solve the Partition Equal Subset Sum problem by applying dynamic programming. Learn to build and use a lookup table to optimize recursive solutions, evaluate time and space complexity, and implement a space-efficient approach to determine if an array can be divided into two subsets with equal sums.
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]