Created a file

Author: Rupa-Rd

src/main/java/com/thealgorithms/dynamicprogramming/SubsetSumSpaceOptimized.java

@@ -0,0 +1,28 @@
+package com.thealgorithms.dynamicprogramming;
+/*
+The Sum of Subset problem determines whether a subset of elements from a
+given array sums up to a specific target value.
+*/
+public final class SubsetSumSpaceOptimized {
+    /*
+    Space Optimized solution using 1D boolean array
+    Time Complexity: O(n * sum)
+    Space complexity: O(sum)
+    */
+    public static boolean isSubsetSum(int[] arr, int sum) {
+        int n = arr.length;
+        // Declare the boolean array with size sum + 1
+        boolean[] dp = new boolean[sum + 1];
+
+        // Initialize the first element as true
+        dp[0] = true;
+
+        // Find the subset sum using 1D array
+        for (int i = 0; i < n; i++) {
+            for (int j = sum; j >= arr[i]; j--) {
+                dp[j] = dp[j] || dp[j - arr[i]];
+            }
+        }
+        return dp[sum];
+    }
+}