Sum_Of_Subset.java updated as per clang format

bhishma620 · bhishma620 · commit 73fb041daf3e · 2024-01-22T16:52:41.000+05:30
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/Sum_Of_Subset.java b/src/main/java/com/thealgorithms/dynamicprogramming/Sum_Of_Subset.java
@@ -1,4 +1,4 @@
-package com.thealgorithms.dynamicprogramming;
+package com.example.algo;
 
 public class Sum_Of_Subset {
 
@@ -13,9 +13,9 @@ public static void main(String[] args) {
         }
     }
 
-
-    private static boolean subsetSum(int[] arr, int n, int Key) {
+    static boolean subsetSum(int[] arr, int n, int Key) {
         boolean[] prev = new boolean[Key + 1];
+
         prev[0] = true;
 
         if (arr[0] <= Key) {

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-package com.thealgorithms.dynamicprogramming;`
	`1`	`+package com.example.algo;`
`2`	`2`
`3`	`3`	`public class Sum_Of_Subset {`
`4`	`4`
`@@ -13,9 +13,9 @@ public static void main(String[] args) {`
`13`	`13`	`}`
`14`	`14`	`}`
`15`	`15`
`16`		`-`
`17`		`- private static boolean subsetSum(int[] arr, int n, int Key) {`
	`16`	`+ static boolean subsetSum(int[] arr, int n, int Key) {`
`18`	`17`	`boolean[] prev = new boolean[Key + 1];`
	`18`	`+`
`19`	`19`	`prev[0] = true;`
`20`	`20`
`21`	`21`	`if (arr[0] <= Key) {`