https://leetcode.com/problems/climbing-stairs/description/

interview_prep/algorithm/java/src/main/java/hoa/can/code/ez/ClimbStairs.java

@@ -0,0 +1,22 @@
+package hoa.can.code.ez;
+
+/**
+ * <a href="https://leetcode.com/problems/climbing-stairs/">desc</a>
+ */
+public class ClimbStairs {
+    public int climbs(int n) {
+        if (n <= 2) {
+            return n;
+        }
+
+        int[] dp = new int[n + 1];
+        dp[1] = 1;
+        dp[2] = 2;
+
+        for (int i = 3; i <= n; i++) {
+            // either one or two steps away
+            dp[i] = dp[i - 1] + dp[i - 2];
+        }
+        return dp[n];
+    }
+}

interview_prep/algorithm/java/src/test/java/hoa/can/code/ClimbStartsTest.java

@@ -0,0 +1,19 @@
+package hoa.can.code;
+
+import hoa.can.code.ez.ClimbStairs;
+import org.junit.jupiter.api.DisplayName;
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+public class ClimbStartsTest {
+    ClimbStairs sol = new ClimbStairs();
+
+    @Test
+    @DisplayName("https://leetcode.com/problems/climbing-stairs/")
+    public void test() {
+        assertEquals(0, sol.climbs(0));
+        assertEquals(1, sol.climbs(1));
+        assertEquals(3, sol.climbs(3));
+    }
+}