<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 sum = accumulate(nums.begin(), nums.end(),0);
        if(sum%2!=0){
            return false;
        }
        else{
            int n= nums.size();
            vector<vector<bool>> dp(201,vector<bool>(20001,false));
            for(int i=0;i<n;i++){
                dp[i][0]=true;
            }
            for(int i=0;i<=sum;i++){
                dp[0][i]= (nums[0]==i);
            }

            for(int i=1;i<n;i++){
                for(int j=0;j<=sum/2;j++){
                    bool not_take = dp[i-1][j];
                    bool take= false;
                    if(j>=nums[i]){
                        take =dp[i-1][j-nums[i]];
                    }

                    dp[i][j]=take|not_take;
                }
            }
            return dp[n-1][sum/2];
        }
    }
};
85125