Added more problems

Author: Mehulcoder

Dynamic programming 2/Subsetsum.cpp

@@ -27,12 +27,78 @@ YES
 
 using namespace std;
 
+void go(vector<int> arr, int n, int i , int sum){
+	vector<vector<int>> dp(n+1, vector<int>(sum+1, 0));
+
+	for (int i = 0; i < n+1; ++i)
+	{
+		dp[i][0] = 1;
+	}
+
+	for (int i = 1; i < sum+1; ++i)
+	{
+		dp[n][i] = 0;
+	}
+
+	for (int j = 1; j < sum+1; ++j)
+	{
+		for (int i = n-1; i >= 0; --i)
+		{
+			bool c1 = 0;
+			if (j-arr[i]>=0)
+			{
+				c1 = dp[i+1][j-arr[i]];	
+			}
+
+			if (c1 == 1)
+				dp[i][j] = 1;
+			else
+			{
+				dp[i][j] = dp[i+1][j];
+
+			}
+		}
+	}
+
+	// for (int i = 0; i < n+1; ++i)
+	// {
+	// 	for (int j = 0; j < sum+1; ++j)
+	// 	{
+	// 		cout<<dp[i][j]<<" ";
+	// 	}
+	// 	cout <<'\n';
+	// }
+
+	if (dp[0][sum] == 1)
+	{
+		cout << "Yes" << '\n';
+	}else
+		cout << "No" << '\n';
+
+	return;
+
+
+
+}
 
 int main( int argc , char ** argv )
 {
 	ios_base::sync_with_stdio(false) ; 
-	cin.tie(NULL) ; 
+	cin.tie(NULL); 
 
+	int n;
+	cin>>n;
+
+	vector<int> arr(n, 0);
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>arr[i];
+	}
+
+	int sum;
+	cin>>sum;
+
+	go(arr, n, 0, sum);
 
 
 

Dynamic programming 2/Test.txt

@@ -1,5 +1,3 @@
-2 2
-2 1
-1 1
-
-0 0
+2
+1 2
+0