From 8db08355114faa36fc672d7cbb63909acb26b9d8 Mon Sep 17 00:00:00 2001
From: YogeshPardeshi <31638743+YogeshPardeshi@users.noreply.github.com>
Date: Fri, 22 May 2026 22:17:13 -0400
Subject: [PATCH 1/2] Create Problem1.java

---
 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..c5701658
--- /dev/null
+++ b/Problem1.java
@@ -0,0 +1,25 @@
+class Problem1 {
+    public int coinChange(int[] coins, int amount) {
+        int m = coins.length;
+        int n = amount;
+
+        int[][] dp = new int[m + 1][n + 1];
+
+        for (int j = 1; j <= n; j++) {
+            dp[0][j] = 99999;
+        }
+
+        for (int i = 1; i <= m; i++) {
+            for (int j = 0; j <= n; j++) {
+                if (j < coins[i - 1]) {
+                    dp[i][j] = dp[i - 1][j];
+                } else {
+                    dp[i][j] = Math.min(dp[i - 1][j], 1 + dp[i][j - coins[i - 1]]);
+                }
+            }
+        }
+
+        if (dp[m][n] == 99999) return -1;
+        return dp[m][n];
+    }
+}

From a51bc991af5ff0f4718db32f3328e7523c79a684 Mon Sep 17 00:00:00 2001
From: YogeshPardeshi <31638743+YogeshPardeshi@users.noreply.github.com>
Date: Fri, 22 May 2026 22:18:04 -0400
Subject: [PATCH 2/2] Create Problem2.java

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

diff --git a/Problem2.java b/Problem2.java
new file mode 100644
index 00000000..210dd007
--- /dev/null
+++ b/Problem2.java
@@ -0,0 +1,16 @@
+class Problem2 {
+    public int rob(int[] nums) {
+        int n = nums.length;
+        if(n == 1) return nums[0];
+        int[] dp = new int[n];
+
+        dp[0] = nums[0];
+        dp[1] = Math.max(nums[0], nums[1]);
+
+        for(int i=2; i<n; i++){
+            dp[i] = Math.max(dp[i-1], nums[i]+dp[i-2]);
+        }
+
+        return dp[n-1];
+    }
+}