<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 canPartition(vector<int>& nums) {
        int g= 0;
        for(int i :nums){
            g += i;
        }
        sort(nums.begin(),nums.end());
        if(g%2==0){
            int val =g/2;
            if(finder(val,nums,0)){
                return true;
            }
        }
        
        return false;
    }
    map<int,map<int,int>> mp;
    bool finder(int val , vector<int>& nums ,int i){
        if(val < 0){
            return false;
        }
        if(val == 0){
            return true;
        }
        if(i >= nums.size()){
            return false;
        }
        if(mp[val].count(i)){
            return false;
        }
        if(val - nums[i] >= 0){
            if(finder(val-nums[i],nums,i+1)){
                return true;
            }
            if(finder(val,nums,i+1)){
                return true;
            }
        }
        mp[val][i] = false;
        return false;

    }
};
79398