<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:
   bool solve(vector<int>&nums,int x,int index,vector<vector<int>>&dp){
    if(x==0){
        return true;
    }
    if(x<0){
        return 0;
    }
    if(index>=nums.size()){
        return 0;
    }
    if(dp[x][index]!=-1){
        return dp[x][index];
    }
    int take=solve(nums,x-nums[index],index+1,dp);
    int notTake=solve(nums,x,index+1,dp);
    dp[x][index]= take or notTake;
    return take or notTake;
   }
    bool canPartition(vector<int>& nums) {
       int sum=0;
       int n=nums.size();
       for(int i=0;i<nums.size();i++){
        sum+=nums[i];
       }
       vector<vector<int>>dp(sum/2+1,vector<int>(n+1,-1));
       if(sum%2==0){
        return solve(nums,sum/2,0,dp);
       } 
       else{
        return false;
       }
    }
};
148128