Practice Partition Equal Subset Sum
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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.
Source: Partition Equal Subset Sum on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
Input
nums = [1,5,11,5]
Output
true
# Example 2
Input
nums = [1,2,3,5]
Output
false
Constraints
1 <= nums.length <= 200
1 <= nums[i] <= 100
Related LeetCode Problems
Practice more problems similar to Partition Equal Subset Sum.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.