_416. Partition Equal Subset Sum.md

416. Partition Equal Subset Sum

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : April 07, 2025

Last updated : April 07, 2025

---

Related Topics : Array, Dynamic Programming

Acceptance Rate : 48.21 %

---

Solutions

• m416 v1.py

Python

m416 v1.py

class Solution:
    def canPartition(self, nums: List[int]) -> bool:
        tot = sum(nums)
        if tot % 2 :
            return False
        dp = [True] + [False] * (tot // 2)

        for num in nums :
            for i in range(len(dp) - 1, num - 1, -1) :
                dp[i] = dp[i] or dp[i - num]

        return dp[-1]