Final fix

Rupa-Rd · Rupa-Rd · commit e7917517b80b · 2024-10-06T15:44:57.000+05:30
diff --git a/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java b/src/main/java/com/thealgorithms/dynamicprogramming/SubsetSum.java
@@ -35,7 +35,7 @@ public static boolean subsetSum(int[] arr, int sum) {
     }
 
     /*
-    Space Optimized solution using 1D boolean array 
+    Space Optimized solution using 1D boolean array
     Time Complexity: O(n * sum)
     Space complexity: O(sum)
     */

Original file line number	Diff line number	Diff line change
`@@ -35,7 +35,7 @@ public static boolean subsetSum(int[] arr, int sum) {`
`35`	`35`	`}`
`36`	`36`
`37`	`37`	`/*`
`38`		`- Space Optimized solution using 1D boolean array`
	`38`	`+ Space Optimized solution using 1D boolean array`
`39`	`39`	`Time Complexity: O(n * sum)`
`40`	`40`	`Space complexity: O(sum)`
`41`	`41`	`*/`