From e96540ab9b65c1924fb9b64ae6f5f83084672f5c Mon Sep 17 00:00:00 2001
From: Dhruv Verma <75657801+Dhruvverma2020@users.noreply.github.com>
Date: Tue, 4 Oct 2022 10:13:59 +0530
Subject: [PATCH] Create target sum

---
 Dynamic Programming/target sum | 48 ++++++++++++++++++++++++++++++++++
 1 file changed, 48 insertions(+)
 create mode 100644 Dynamic Programming/target sum

diff --git a/Dynamic Programming/target sum b/Dynamic Programming/target sum
new file mode 100644
index 0000000..92df3c0
--- /dev/null
+++ b/Dynamic Programming/target sum	
@@ -0,0 +1,48 @@
+int subsetsum(vector<int>&a,int target,int n)
+  {
+      int dp[n+1][target+1];
+      for(int i=0;i<n+1;i++)
+      {
+          for(int j=0;j<target+1;j++)
+          {
+              if(i==0)
+              {
+                  dp[i][j]=0;
+              }
+              if(j==0)
+              {
+                  dp[i][j]=1;
+              }
+          }
+      }
+      for(int i=1;i<n+1;i++)
+      {
+          for(int j=0;j<target+1;j++)
+          {
+              if(a[i-1]>j)
+              {
+                  dp[i][j]=dp[i-1][j];
+              }
+              else
+              {
+                  dp[i][j]=dp[i-1][j-a[i-1]]+dp[i-1][j];
+              }
+          }
+      }
+      return dp[n][target];
+  }
+    int findTargetSumWays(vector<int>&a ,int target) 
+    {
+        int sum=0;
+        int n=a.size();
+        for(int i=0;i<n;i++)
+        {
+            sum=sum+a[i];
+        }
+        int sem=(target+sum)/2;
+        if((sum+target)%2!=0)
+        {
+          return 0;
+        }
+        return subsetsum(a,sem,n);
+    }