Partition Equal Subset Sum

Try to solve the Partition Equal Subset Sum problem.


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.


  • 11 \leq nums.length 200\leq 200
  • 11 \leq nums[i] 100\leq 100


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy