Documenting LeetCode solving.
<h3 id="heading-q105">Q105</h3>
<a target="_blank" href="https://leetcode.com/problems/partition-equal-subset-sum/">416. Partition Equal Subset Sum</a>
Medium.
<pre><code class="lang-python">class Solution:
 def canPartition(self, nums: List[int]) -&gt; bool:
 if sum(nums) % 2:
 return False

 dp = set()
 # make sure dp set is not empty at first iteration
 dp.add(0)
 # two subsets must equal to half of the total sum
 target = sum(nums) // 2

 for i in range(len(nums) - 1, -1, -1):
 nextDP = set()
 for t in dp:
 nextDP.add(t + nums[i])
 nextDP.add(t)
 dp = nextDP

 return True if target in dp else False
</code></pre>

Documenting LeetCode solving.

### Q105

[**416\. Partition Equal Subset Sum**](https://leetcode.com/problems/partition-equal-subset-sum/)

Medium.

```python
class Solution:
    def canPartition(self, nums: List[int]) -> bool:
        if sum(nums) % 2:
            return False
        
        dp = set()
        # make sure dp set is not empty at first iteration
        dp.add(0)
        # two subsets must equal to half of the total sum
        target = sum(nums) // 2

        for i in range(len(nums) - 1, -1, -1):
            nextDP = set()
            for t in dp:
                nextDP.add(t + nums[i])
                nextDP.add(t)
            dp = nextDP
        
        return True if target in dp else False
```

Day 36 of LeetCode

Q105