Merge pull request VAR-solutions#1103 from HardikSoni11/patch-4

ravivarshney01 · web-flow · commit 769a812b0405 · 2020-10-01T09:06:38.000+05:30
Create SubSetSum.java
diff --git a/Dynamic Programming/sub set sum/Java/SubSetSum.java b/Dynamic Programming/sub set sum/Java/SubSetSum.java
@@ -0,0 +1,29 @@
+class SubSetSum {  
+    static boolean isSubsetSum(int set[], 
+                               int n, int sum) 
+    { 
+        // Base Cases 
+        if (sum == 0) 
+            return true; 
+        if (n == 0) 
+            return false;  
+        if (set[n - 1] > sum) 
+            return isSubsetSum(set, n - 1, sum); 
+        return isSubsetSum(set, n - 1, sum) 
+            || isSubsetSum(set, n - 1, sum - set[n - 1]); 
+    } 
+  
+    /* Driver program to test above function */
+    public static void main(String args[]) 
+    { 
+        int set[] = { 3, 34, 4, 12, 5, 2 }; 
+        int sum = 9; 
+        int n = set.length; 
+        if (isSubsetSum(set, n, sum) == true) 
+            System.out.println("Subset found"
+                               + " with given sum"); 
+        else
+            System.out.println("No subset with"
+                               + " given sum"); 
+    } 
+}
