Partition Equal Subset

Category: Dynamic Programming

Difficulty: intermediate

Description: Check if array can be partitioned equally

Time Complexity: O(n*sum)

Space Complexity: O(sum)

Related LeetCode Problems

• 416. Partition Equal Subset Sum (Medium)
• 494. Target Sum (Medium)
• 198. House Robber (Easy)
• 474. Ones and Zeroes (Medium)
• 1049. Last Stone Weight II (Medium)
• 518. Coin Change 2 (Medium)
• 712. Minimum ASCII Delete Sum for Two Strings (Hard)
• 377. Combination Sum IV (Medium)