From 63341482622e1a75b2fb5332d9016f465961e0c0 Mon Sep 17 00:00:00 2001
From: Swastika Gupta <64654203+Swastyy@users.noreply.github.com>
Date: Mon, 28 Jun 2021 17:36:53 +0530
Subject: [PATCH] Update subset_sum.cpp

---
 backtracking/subset_sum.cpp | 17 +++++++++--------
 1 file changed, 9 insertions(+), 8 deletions(-)

diff --git a/backtracking/subset_sum.cpp b/backtracking/subset_sum.cpp
index 74668a91c..b4e10bf17 100644
--- a/backtracking/subset_sum.cpp
+++ b/backtracking/subset_sum.cpp
@@ -27,23 +27,24 @@ namespace Subsets {
  * @returns count of the number of subsets with required sum
  */
 
-std::uint64_t subset_sum(int sum, std::vector<int>& in_arr) {
-    int nelement = in_arr.size();	//number of subset element
+std::uint64_t subset_sum(int sum, std::vector<int> &in_arr) {
+   	int nelement = in_arr.size();	//number of subset element
 	int count_of_subset = 0;
 
-	for(int i=0; i < (1 << (nelement)); i++){
+	for(int i=0; i < (1 << (nelement)); i++) {
 		std::vector<int> subset;
-		for(int j=0;j<nelement;j++){
-			if (i & (1<<j)){
+		for( int j=0 ; j < nelement ; j++) {
+			if (i & (1<<j)) {
 				subset.push_back(in_arr[j]);
 			}
 		}
 		int check=0;
-		for(int k=0;k<subset.size();k++){
-			check+=subset[k];
+		for( int k=0 ; k < subset.size(); k++) {
+			check += subset[k];
 		}
-		if(check==sum)
+		if(check==sum) {
 			count_of_subset++;
+		}
 	}
 	return count_of_subset;
 }