2022-07-10 update: added "Min Cost Climbing Stairs" (#29)

Author: fartem

Diff for: src/main/java/com/smlnskgmail/jaman/leetcodejava/easy/MinCostClimbingStairs.java

@@ -0,0 +1,28 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+// https://leetcode.com/problems/min-cost-climbing-stairs/
+public class MinCostClimbingStairs {
+
+    private final int[] input;
+
+    public MinCostClimbingStairs(int[] input) {
+        this.input = input;
+    }
+
+    public int solution() {
+        int n = input.length;
+        if (n == 2) {
+            return Math.min(input[0], input[1]);
+        }
+        int[] dp = new int[n + 1];
+        int dpN = dp.length;
+        for (int i = 2; i < dpN; i++) {
+            dp[i] = Math.min(
+                    dp[i - 1] + input[i - 1],
+                    dp[i - 2] + input[i - 2]
+            );
+        }
+        return dp[dpN - 1];
+    }
+
+}

Diff for: src/test/java/com/smlnskgmail/jaman/leetcodejava/easy/MinCostClimbingStairsTest.java

@@ -0,0 +1,17 @@
+package com.smlnskgmail.jaman.leetcodejava.easy;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class MinCostClimbingStairsTest {
+
+    @Test
+    public void defaultTest() {
+        assertEquals(
+                15,
+                new MinCostClimbingStairs(new int[]{10, 15, 20}).solution()
+        );
+    }
+
+}