#416 Partition Equal Subset Sum

Medium Acceptance 0%

description

Problem Description

Given an integer array `nums`, return `true` if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or `false` otherwise.

checklist Constraints

1 <= nums.length <= 200
1 <= nums[i] <= 100

science Examples

Case #1

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

Out: true

Case #2

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

Out: false

Mastery Tags

Arrays Dynamic Programming

Hiring Companies

Amazon Google Meta

code