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

int fun(int n,int temp_sum, vector< int > &nums, int dp[][40001]){
           
            if(temp_sum==0 && n==-1){
                return 1;
            }
            if(n==-1) return 0;
            
            int key;
            if(temp_sum<0) key=20000+abs(temp_sum);
            else   key=temp_sum;
            if(n==-1) return 0;
            
            if(dp[n][key]!=-1) return dp[n][key] ;
            
            return dp[n][key]= fun(n-1,temp_sum+nums[n],nums,dp) || fun(n-1,temp_sum-nums[n],nums,dp) ;

}
class Solution {
public:
    bool canPartition(vector<int>& nums) {
      int n=nums.size();
      int dp[n][40001];
      for(int i=0;i<n;i++){
        for(int j=0;j<40001;j++){
            dp[i][j]=-1;
        } 
      }
      return fun(n-1,0,nums,dp);
    }
};
47896