python: Create partition to k equal sum subsets.

python/0698-partition-to-k-equal-sum-subsets.py

@@ -0,0 +1,42 @@
+class Solution(object):
+ def canPartitionKSubsets(self, nums, k):
+ """
+ :type nums: List[int]
+ :type k: int
+ :rtype: bool
+ """
+
+ if sum(nums) % k != 0:
+ return False
+
+ nums.sort(reverse = True)
+ target = sum(nums) / k
+ visited= set()
+
+ def backtrack(idx, count, currSum):
+ if count == k:
+ return True
+
+ if target == currSum:
+ return backtrack(0, count + 1, 0)
+
+ for i in range(idx, len(nums)):
+
+ # skip duplicates if last same number was skipped
+ if i > 0 and (i - 1) not in visited and nums[i] == nums[i - 1]:
+ continue
+
+ if i in visited or currSum + nums[i] > target:
+ continue
+
+ visited.add(i)
+
+ if backtrack(i + 1, count, currSum + nums[i]):
+ return True
+
+ visited.remove(i)
+
+ return False
+
+
+ return backtrack(0, 0, 0)