Skip to content

problem14.md

Latest commit

 

History

History
16 lines (12 loc) · 515 Bytes

problem14.md

File metadata and controls

16 lines (12 loc) · 515 Bytes

Problem 14: The Partition Equalizer (Partition Equal Subset Sum)

Problem Statement

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

Input Format

  • An array of positive integers nums.

Constraints

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

Example

Input: nums = [1, 5, 11, 5]
Output: True
Explanation: The array can be partitioned as [1, 5, 5] and [11].