<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 {
public:
    vector<vector<int>> dp;
    bool solve(int idx, int sum, vector<int>&A)
    {
        if(idx==A.size())
        {
            if(sum==0) return true;
            return false;
        }
        if(dp[idx][sum]!=-1) return dp[idx][sum];
        if(A[idx]<=sum)
            dp[idx][sum]=solve(idx+1, sum-A[idx], A)|| solve(idx+1, sum, A);
        else
            dp[idx][sum]=solve(idx+1, sum, A);
        return dp[idx][sum];
    }
    bool canPartition(vector<int>& A) 
    {
        int sum=0;
        for(auto x:A) sum+=x;
        if(sum%2==1) return false;

        dp.clear();
        dp.resize(A.size()+1, vector<int>(sum+1, -1));
        return solve(0,sum/2, A);
        
    }
};
185356