Data-Structures-and-Algorithms/CPP/recursion/Subset with given Target at main · codemistic/Data-Structures-and-Algorithms · GitHub

Name: Data-Structures-and-Algorithms/CPP/recursion/Subset with given Target at main · codemistic/Data-Structures-and-Algorithms · GitHub
Rating: 4.7 (2643 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

void solve(int i , int arr[],int sum,int target ,vector<int>ans,int n)
{
 if(i>=n)
 {
 if(sum==target)
 {
 for(auto it : ans)
 {
 cout<<it<<" ";

 }
 cout<<endl;

 }
 return;
 }
 ans.push_back(arr[i]);
 sum+=arr[i];
 solve(i+1,arr,sum,target ,ans,n);
 sum-=arr[i];
 ans.pop_back();

 solve(i+1,arr,sum,target ,ans,n);
}


int main() {

int arr[]={1,2,1};
int n =3;
int target=2;
vector<int>ans;

solve(0,arr,0,target ,ans,n);
}