<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 total_sum = 0;
        for (auto elem : nums) {
            total_sum += elem;
        }

        if ((total_sum % 2) != 0) {
            return false;
        }

        std::unordered_set<int> prev, current;
        prev.insert(0);
        for (int i = 0; i < nums.size(); ++i) {
            for (auto &elem : prev) {
                current.insert(elem + nums[i]);
            }
            prev = current;
        }

        for (auto &elem : prev) {
            std::cout << elem << "\n";
        }
        return prev.find(total_sum / 2) != prev.end();
    }
};
45033