<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 sol(self,ind,sum1,sum2,nums,dp):

        if(ind < 0):
            return False
        
        if (sum1==sum2):
            return True

        
        
        if (ind,sum1) in dp:
            return dp[(ind,sum1)]

        rightadd = self.sol(ind - 1,sum1 - nums[ind] , sum2 + nums[ind],nums,dp)
        leftadd = self.sol(ind - 1,sum1,sum2,nums,dp)

        dp[(ind,sum1)] = leftadd or rightadd

        return dp[(ind,sum1)]
        
    def canPartition(self, nums: List[int]) -> bool:
        dp = {}
        return self.sol(len(nums)-1,sum(nums),0,nums,dp )
132298