Combinations

 https://www.interviewbit.com/problems/combinations/

 


void comb(int n, int k, int st, vector<vector<int> > &v, vector<int> v1)
{
    if(k == 0)
    {
        v.push_back(v1);
        return;
    }
    for(auto i=st; i<=n; i++)
    {
        v1.push_back(i);
        comb(n, k-1, i+1, v, v1);
        v1.pop_back();
    }
}


vector<vector<int> > Solution::combine(int n, int k) {
    vector<vector<int> > v;
    vector<int> v1;
    
    comb(n, k, 1, v, v1);
    sort(v.begin(), v.end());
    
    return v;
}


 

Comments

Popular posts from this blog

Perfect Peak of Array

Is Rectangle?

Sort array with squares!