medium

Partition Equal Subset Sum

Given an array of positive integers, decide whether it can be split into two groups with equal sums.

Constraints
  • 1 ≤ n ≤ 200
  • 1 ≤ nums[i] ≤ 100
Examples
in: nums = [1,5,11,5]
out: true
{1,5,5} and {11}.
in: nums = [1,2,3,5]
out: false

Code it yourself

Solve in
Test execution is not yet available for this exercise.Practice journal →Draft saved in this browser.
Hints:
Which approach applies?

Choose an approach to check your pattern recognition, or reveal the discussion when you need help.