Added solution - LeetHub

Subset Sums - GFG/subset-sums.cpp

@@ -0,0 +1,53 @@
+//{ Driver Code Starts
+#include<bits/stdc++.h> 
+using namespace std; 
+
+// } Driver Code Ends
+class Solution
+{
+public:
+    void solve(vector<int> &nums,int n,int i,vector<int> &ans,int sum)
+    {
+        if(i>=n)
+        {
+            ans.push_back(sum);
+            return;
+        }
+        //lo
+        solve(nums,n,i+1,ans,sum);
+        sum=sum+nums[i];
+        solve(nums,n,i+1,ans,sum);
+    }
+    vector<int> subsetSums(vector<int> arr, int N)
+    {
+        vector<int> ans;
+        solve(arr,N,0,ans,0);
+        return ans;
+        // Write Your Code here
+    }
+};
+
+//{ Driver Code Starts.
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int N;
+        cin>>N;
+        vector<int> arr(N);
+        for(int i = 0 ; i < N ; i++){
+            cin >> arr[i];
+        }
+        Solution ob;
+        vector<int> ans = ob.subsetSums(arr,N);
+        sort(ans.begin(),ans.end());
+        for(auto sum : ans){
+            cout<< sum<<" ";
+        }
+        cout<<endl;
+    }
+    return 0;
+}
+// } Driver Code Ends