175. Partition Equal Subset Sum

Medium

Topics

Companies

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 total sum is 22. The target sum for each subset is 11. The array can be partitioned into [1, 5, 5] (sum 11) and [11] (sum 11).

Example 2:

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

Output: false

Explanation: The total sum is 11, which is an odd number. It is impossible to partition an array with an odd total sum into two subsets with equal integer sums.

Constraints:

•
•
•

Time Complexity

O(n × target)

Space Complexity

O(target)

175. Partition Equal Subset Sum

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

175. Partition Equal Subset Sum

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases