9.md

#Combination Sum3 Practice

void findCombo(int k,int n,vector<vector<int>>&ans,vector<int>temp,int i){


        if(n==0 && k==0)
            ans.push_back(temp);

        if(k==0 || i>9 || i>n)
            return;

        temp.push_back(i);
        findCombo(k-1,n-i,ans,temp,i+1);

        temp.pop_back();
        findCombo(k,n,ans,temp,i+1);
    }

    vector<vector<int>> combinationSum(int k, int n) {

        vector<vector<int>>ans;

      vector<int>temp;

      findCombo( k, n,ans,temp,1);

      return ans;

    }