36. Partition Equal Subset

Medium

Topics

Helpful tools to learn & understand

Watch key transitions, pointers, and variables update step-by-step.

Open

Read clean, documented implementations across multiple patterns.

View Code

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

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

Output: true

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

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

Output: false

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

Input: nums = [1, 2, 5]

Output: false

Explanation: Total sum is 8, target is 4. No subset sums to 4.

Time Complexity

O(n*sum)

Space Complexity

O(sum)