<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 {
    bool func(int ind, vector<int>& nums, int sum, vector<vector<int>>&dp) {
        if (sum == 0)
            return true;
        if (ind == 0)
            return nums[0] == sum;

        if(dp[ind][sum] != -1) return dp[ind][sum];

        bool n = func(ind - 1, nums, sum, dp);
        bool t = false;
        if (nums[ind] <= sum)
            t = func(ind - 1, nums, sum - nums[ind], dp);

        return dp[ind][sum] = t | n;
    }


    bool tabulate(vector<int>& nums, int sum){
        int n = nums.size();
        vector<vector<bool>>dp(n+100, vector<bool>(sum+100, false));
        for(int i=0; i<nums.size(); i++){
            dp[i][0] = true;
        }

        for(int i=1; i<=n; i++){
            for(int j=1; j<=sum; j++){
                bool take = false;
                if(nums[i-1]<=j){
                    take = dp[i-1][j-nums[i-1]];
                }
                bool notTake = dp[i-1][j];
                dp[i][j] = take|notTake;
            }
        }

        return dp[n][sum];
    }

public:
    bool canPartition(vector<int>& nums) {
        int sum = 0;
        
        for (int i = 0; i < nums.size(); i++) {
            sum += nums[i];
        }

        if (sum % 2 != 0)
            return false;
        
        int sum1 = sum/2;
        vector<vector<int>>dp(nums.size(), vector<int>(sum1+1, -1));
        return tabulate(nums, sum1);
        //return func(nums.size() - 1, nums, sum1, dp);
    }
};
108035