<p>Given an integer array <code>nums</code> and an integer <code>k</code>, return <code>true</code> if it is possible to divide this array into <code>k</code> non-empty subsets whose sums are all equal.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,3,2,3,5,2,1], k = 4
<strong>Output:</strong> true
<strong>Explanation:</strong> It is possible to divide it into 4 subsets (5), (1, 4), (2,3), (2,3) with equal sums.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4], k = 3
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 16</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>4</sup></code></li>
	<li>The frequency of each element is in the range <code>[1, 4]</code>.</li>
</ul>

class Solution {
public:
    bool canPartitionKSubsets(vector<int>& nums, int k) {
        int sum = accumulate(nums.begin(), nums.end(), 0);

        if (sum % k != 0) return false;

        sum /= k;
        sort(nums.rbegin(), nums.rend()); // Sort in descending order
        vector<bool> visit(nums.size(), false);
        unordered_map<int, bool> memo; // Memoization

        return find(nums, k, 0, 0, sum, visit, memo);
    }

    bool find(vector<int>& nums, int k, int start, int temp, int& sum, vector<bool>& visit, unordered_map<int, bool>& memo) {
        if (k == 0) return true;
        if (temp == sum) return find(nums, k - 1, 0, 0, sum, visit, memo);

        int state = 0;
        for (int i = 0; i < visit.size(); ++i) {
            if (visit[i]) state |= (1 << i);
        }
        if (memo.find(state) != memo.end()) return memo[state];

        for (int i = start; i < nums.size(); ++i) {
            if (!visit[i] && temp + nums[i] <= sum) {
                visit[i] = true;
                if (find(nums, k, i + 1, temp + nums[i], sum, visit, memo)) {
                    memo[state] = true;
                    return true;
                }
                visit[i] = false;
            }
 
        
        }

        memo[state] = false;
        return false;
    }
};

31630