Partition to K Equal Sum Subsets - Swift Solution @ LeetCode
Partition to K Equal Sum Subsets, is a LeetCode problem from graphs subdomain. In this post we will see how we can solve this challenge in Swift
Problem Description
You can find the full details of the problem Partition to K Equal Sum Subsets at LeetCode
Solution
DFS to check whether there is a valid solution
Time Complexity: O(k^n), Space Complexity: O(n)
Please check the main.swift snippet for the solution.
This solution originally posted at: Github by @soapyigu
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.