<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 isSubsetSum(vector<int>& arr, int sum){
        int n = arr.size();
        vector<vector<bool>> dp(n, vector<bool>(1e5 + 1, 0));
        for(int i = 0;i < n;i++) dp[i][0] = true;
        dp[0][arr[0]] = true;
        for(int ind = 1;ind < n;ind++) {
            for(int target = 1;target <= sum; target++) {
                bool notpick = dp[ind - 1][target];
                bool pick = false;
                if(target >= arr[ind]) pick = dp[ind - 1][target - arr[ind]];
                
                dp[ind][target] = (pick || notpick);
            }
        }
        return dp[n - 1][sum];
    }
    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 == 1) return false;
        sum = sum / 2;
        return isSubsetSum(nums, sum);
    }
};
105171