<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 helper(int ind,vector<vector<int>>& dp,vector<int>& nums,int target){
        if(target==0) return true;
        if(ind==0) return (nums[0]==target);
        if(dp[ind][target]!=-1) return dp[ind][target];
        bool notTake=helper(ind-1,dp,nums,target);
        bool take=false;
        if(nums[ind]<=target) take=helper(ind-1,dp,nums,target-nums[ind]);
        return dp[ind][target]=(take || notTake);
    }
    bool canPartition(vector<int>& nums) {
        int n=nums.size();
        int sum=0;
        for(int i=0;i<n;i++){
           sum+=nums[i];
        }
        if(sum%2!=0) return false;
        vector<vector<int>>dp(201,vector<int>(sum/2+1,-1));
        return helper(n-1,dp,nums,sum/2);
    }
};
156719