From a29d71e7559f9b8e9f3a7dc22dbafa4b7429007d Mon Sep 17 00:00:00 2001
From: Sethu Manickam <sethu.sxcs@gmail.com>
Date: Tue, 28 Oct 2025 08:08:30 -0700
Subject: [PATCH 1/2] Implement combinationSum method with backtracking

---
 Problem1.java | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 Problem1.java

diff --git a/Problem1.java b/Problem1.java
new file mode 100644
index 00000000..ce9f8f60
--- /dev/null
+++ b/Problem1.java
@@ -0,0 +1,25 @@
+class Solution {
+    List<List<Integer>> result;
+    public List<List<Integer>> combinationSum(int[] candidates, int target) {
+        if (candidates == null || candidates.length == 0) return new ArrayList<>();
+
+        result = new ArrayList<>();
+
+        backtrack(candidates, target, 0, 0, new ArrayList<>());
+
+        return result;
+    }
+
+    public void backtrack(int[] candidates, int target, int index, int currSum, List<Integer> combination) {
+        if (currSum == target) {
+            result.add(new ArrayList<>(combination));
+            return;
+        }
+        if (currSum > target || index == candidates.length) return;
+
+        combination.add(candidates[index]);
+        backtrack(candidates, target, index, currSum + candidates[index], combination);
+        combination.removeLast();
+        backtrack(candidates, target, index + 1, currSum, combination);
+    }
+}

From 6a8cc8de482da8df3cef980852067f3ac4151556 Mon Sep 17 00:00:00 2001
From: Sethu Manickam <sethu.sxcs@gmail.com>
Date: Tue, 28 Oct 2025 08:08:48 -0700
Subject: [PATCH 2/2] Create Problem2.java

---
 Problem2.java | 42 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Problem2.java

diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 00000000..4620c1fc
--- /dev/null
+++ b/Problem2.java
@@ -0,0 +1,42 @@
+class Solution {
+    List<String> result;
+    public List<String> addOperators(String num, int target) {
+        if (num == null || num.length() == 0) return new ArrayList<>();
+
+        result = new ArrayList<>();
+        
+        backtrack(num, target, 0, 0, 0, "");
+
+        return result;
+    }
+
+    public void backtrack(String num, int target, int index, long calc, long tail, String exp) {
+
+        if (index == num.length()) {
+            if (target == calc) result.add(exp);
+            return;
+        }
+
+        for (int i=index; i<num.length(); i++) {
+
+            long curr = Long.parseLong(num.substring(index, i + 1));
+
+            // if it is not a single digit number and the first digit is 0 then we should skip this iteration
+
+            if (index != i && num.charAt(index) == '0') break;
+
+            if (index == 0) {
+                // 1st digit or number
+                backtrack(num, target, i + 1, calc + curr, curr, curr + "");
+            } else {
+                // + operator
+                backtrack(num, target, i + 1, calc + curr, curr, exp + "+" + curr);
+                // - operator
+                backtrack(num, target, i + 1, calc - curr, -curr, exp + "-" + curr);
+                // * operator
+                backtrack(num, target, i + 1, (calc-tail) + (tail*curr), tail*curr, exp + "*" + curr);
+            }
+        }
+
+    }
+}