<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:
    def canPartitionKSubsets(self, nums: List[int], k: int) -> bool:
        if sum(nums)%k!=0:
            return False
        t=[sum(nums)//k]
        dp={}
        def dfs(mask,subsum,k):
            if mask in dp:
                return dp[mask]
            if subsum==0:
                subsum=t[0]
                k-=1
            if k==0:
                return True
            for i in range(len(nums)):
                if 1<<i & mask:
                    continue
                if nums[i]>subsum:
                    dp[mask|1<<i]=False
                else:
                    if dfs(mask|1<<i,subsum-nums[i],k):
                        dp[mask]=True
                        return True
            dp[mask]=False
            return False
        return dfs(0,sum(nums)//k,k)


        
52726