//Partition to K Equal Sum Subsets
class Solution {
public:
bool dfs(vector &nums, vector visited, int idx,int k,int currSum,int targetSum){
if(k==1){
//All subsets are found
return true;
}
if(currSum==targetSum){
//one subset found
return dfs(nums,visited,0,k-1,0,targetSum);
}
for(int i=idx;i& nums, int k) {
vector visited(nums.size(),false);
int sum=0;
for(int i=0;i