36. Partition Equal Subset

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: true

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

Example 2:

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

Output: false

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

Example 3:

Input: nums = [1, 2, 5]

Output: false

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

Constraints:

•
•

Time Complexity

O(n*sum)

Space Complexity

O(sum)

36. Partition Equal Subset

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

36. Partition Equal Subset

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases