Tap here to switch tabs
Problem
Submissions

Problem: Partition Equal Subset Sum

Partition Equal Subset Sum asks whether a non-empty array of positive integers can be split into two subsets whose sums are equal, returning true or false.

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:

  • 1≤1 \leq nums.length ≤200\leq 200
  • 1≤1 \leq nums[i] ≤100\leq 100
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Partition Equal Subset Sum

Partition Equal Subset Sum asks whether a non-empty array of positive integers can be split into two subsets whose sums are equal, returning true or false.

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:

  • 1≤1 \leq nums.length ≤200\leq 200
  • 1≤1 \leq nums[i] ≤100\leq 100