Partition Equal Subset Sum
Try to solve the Partition Equal Subset Sum problem.
We'll cover the following
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]
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy