<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 = 0;
        int n = nums.size();

        for(int i=0; i<n; i++)
        {
            sum+=nums[i];
        }

        if(sum %2 != 0) return false;
        int target = sum/2;

        vector<int> prev(target+1, 0);
        prev[0] = 1;
        if(nums[0] <= target)
        {
            prev[nums[0]] = 1;
        }

        for(int i=1; i<n; i++)
        {
            vector<int> curr(target+1, 0);
            curr[0] = 1;
            for(int j=1; j<=target; j++)
            {
                bool pick = false;
                if(j >= nums[i]) pick = prev[j - nums[i]];
                curr[j] = pick || prev[j];
            }
            prev = curr;
        }

        return prev[target];
    }
};
93716