<p>Given an integer array <code>nums</code>, return <code>true</code> <em>if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,5,11,5]
<strong>Output:</strong> true
<strong>Explanation:</strong> The array can be partitioned as [1, 5, 5] and [11].
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,5]
<strong>Output:</strong> false
<strong>Explanation:</strong> The array cannot be partitioned into equal sum subsets.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 200</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 100</code></li>
</ul>

class Solution:
    def canPartition(self, nums: List[int]) -> bool:
        l,target = 0,0
        for i in nums:
            l+=1
            target += i 
        if target%2!=0:
            return False
        else:
            target = int(target/2)

        dp = defaultdict(lambda:None)
        def recursive(i,target):
            if target==0:
                return True
            if i ==0:
                if target-nums[i]==0:
                    return True
                else:
                    return False
            

            if dp[(i,target)]!=None:
                return dp[(i,target)]
            else:
                take = recursive(i-1,target-nums[i])
                if take:
                    dp[(i,target)] = take
                    return True
                nottake = recursive(i-1,target)
            dp[(i,target)] = take or nottake
            return dp[(i,target)]

        
        return recursive(l-1,target)
        
370448