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

        for (auto e: nums) {
            sum += e;
        }

        set<int> candidates;

        candidates.insert(0);

        for (auto e: nums) {
            vector<int> newCandidates;
            for (auto x: candidates) {
                if ((x + e) * 2 == sum) {
                    cout << x + e << endl;
                    cout << sum << endl;
                    return true;
                }

                if ((x + e) * 2 > sum) {
                    break;
                }

                newCandidates.push_back(x + e); // dont push to set, coz it will be iterate 
            }

            for (auto x: newCandidates) {
                candidates.insert(x);
            }

            candidates.insert(e);
        }

        return false;
    }
};
130945