Updated main and test

Author: bhishma620

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

@@ -0,0 +1,18 @@
+package com.thealgorithms.dynamicprogramming;
+
+public class SumOfSubset {
+
+    public static boolean subsetSum(int[] arr, int num, int Key) {
+        if (Key == 0) {
+            return true;
+        }
+        if (num < 0 || Key < 0) {
+            return false;
+        }
+
+        boolean include = subsetSum(arr, num - 1, Key - arr[num]);
+        boolean exclude = subsetSum(arr, num - 1, Key);
+
+        return include || exclude;
+    }
+}

src/test/java/com/thealgorithms/dynamicprogramming/SumOfSubsetTest.java

@@ -0,0 +1,21 @@
+package com.thealgorithms.dynamicprogramming;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import org.junit.jupiter.api.Test;
+
+class SumOfSubsetTest {
+
+    @Test
+    void basicCheck() {
+        assertEquals(true, SumOfSubset.subsetSum(new int[] {7, 3, 2, 5, 8}, 4, 14));
+
+        assertEquals(true, SumOfSubset.subsetSum(new int[] {4, 3, 2, 1}, 3, 5));
+
+        assertEquals(false, SumOfSubset.subsetSum(new int[] {1, 2, 7, 10, 9}, 4, 14));
+
+        assertEquals(false, SumOfSubset.subsetSum(new int[] {2, 15, 1, 6, 7}, 4, 4));
+
+        assertEquals(true, SumOfSubset.subsetSum(new int[] {1, 7, 2, 9, 10}, 4, 13));
+    }
+}