<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>


def get_sum(arr,st,en,k,dp):
    if st > en:
        return k==0
    if (st,k) in dp:
        return dp[(st,k)]
    # do nothing
    x1 = get_sum(arr,st+1,en,k,dp)
    x2 = get_sum(arr,st+1,en,k-arr[st],dp)
    dp[(st,k)] = x1 or x2
    return dp[(st,k)]

class Solution:
    def canPartition(self, arr: List[int]) -> bool:
        k = sum(arr)
        if k%2==1:
            return False
        k = k//2
        dp = {}
        get_sum(arr,0,len(arr)-1,k,dp)
        return dp[(0,k)]
287095