class Solution {
public:
vector<int> buffer;
vector< vector<int> > ans;
void print( vector<int> &array, int n, int k, int target, int index ) {
if( target < 0 ) {
return;
}
if( target == 0 ) {
ans.push_back(buffer);
/*for(int i = 0 ; i < index ; i++ ) {
cout << buffer[i] << " ";
}*/
return;
}
for( int i = k ; i < n ; i++ ) {
buffer.push_back(array[i]);
//buffer[index] = array[i];
print(array,n, i,target-array[i],index+1);
buffer.pop_back();
}
}
vector<vector<int> > combinationSum(vector<int> &candidates, int target) {
sort(candidates.begin(),candidates.end());
print(candidates,candidates.size(),0,target,0);
return ans;
}
};
System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
800+ learners
Details →Designing Microservices
A free playlist to help you understand Microservices and their high-level patterns in depth.
17+ learners
Details →GitHub Outage Dissections
A free playlist to help you learn core engineering from outages that happened at GitHub.
67+ learners
Details →Hash Table Internals
A free playlist to help you understand the internal workings and construction of Hash Tables.
25+ learners
Details →BitTorrent Internals
A free playlist to help you understand the algorithms and strategies that power P2P networks and BitTorrent.
42+ learners
Details →