#416

Partition Equal Subset Sum

specialist · 875 · lc medium +31 · verified · 49.2% accepted · 13,790 likes · top 36%

Description

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.

Code

1

2

3

class Solution:
    def canPartition(self, nums: List[int]) -> bool:

class Solution:
    def canPartition(self, nums: List[int]) -> bool: