Medium

Quiz

#416 Partition Equal Subset Sum

APPROACH

Given an integer array nums, determine whether it can be split into two non-empty subsets with equal element sums. Return true if such a partition exists, otherwise false.

Example 1:

Input: nums = [1,5,11,5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: nums = [1,2,3,5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

1 of 4

1:00

What is the optimal approach for this problem?