Problem
Ask
Submissions

Problem: Partition Equal Subset Sum

Medium
30 min
Understand how to use dynamic programming to solve the Partition Equal Subset Sum problem. Learn to assess an array and determine if it can be divided into two subsets of equal sum, a common coding interview challenge.

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:

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

Problem: Partition Equal Subset Sum

Medium
30 min
Understand how to use dynamic programming to solve the Partition Equal Subset Sum problem. Learn to assess an array and determine if it can be divided into two subsets of equal sum, a common coding interview challenge.

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:

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