DP1

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];
+    }
+}

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];
+    }
+}