chore: clean up content phase organization

apps/docs/content/(05-decision-space)/1d-dynamic-programming/70-climbing-stairs.mdx

@@ -0,0 +1,43 @@
+---
+title: '70. Climbing Stairs'
+description: You are climbing a staircase. It takes n steps to reach the top
+icon: dot
+sidebar:
+  label: 'Climbing Stairs'
+  badge: 'Easy'
+---
+
+<Badge variant="accent">Math</Badge>
+
+### Example 1:
+- Input: `n = 2`
+- Output: `2`
+- Explanation: There are two ways to climb to the top. `1`. `1` step + `1` step `2`. `2` steps
+
+### Example 2:
+- Input: `n = 3`
+- Output: `3`
+- Explanation: There are three ways to climb to the top. `1`. `1` step + `1` step + `1` step `2`. `1` step + `2` steps `3`. `2` steps + `1` step
+
+### Constraints:
+
+- `1 <= n <= 45`
+
+## Solution
+
+```py
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        if n == 1:
+            return 1
+        if n == 2:
+            return 2
+
+        first, second = 1, 2
+
+        for _ in range(3, n + 1):
+            third = first + second
+            first, second = second, third
+
+        return second
+```

apps/docs/content/(05-decision-space)/1d-dynamic-programming/meta.ts

@@ -0,0 +1,3 @@
+import { defineMeta } from "blume";
+
+export default defineMeta({ title: "1-D Dynamic Programming", order: 21, icon: "columns-3", display: "group" });

apps/docs/redirects.ts

@@ -16,6 +16,7 @@ export default [
   { from: "/48", to: "/matrix-index-math/rotate-image" },
   { from: "/49", to: "/hash-table/group-anagrams" },
   { from: "/54", to: "/matrix-index-math/spiral-matrix" },
+  { from: "/70", to: "/1d-dynamic-programming/climbing-stairs" },
   { from: "/73", to: "/matrix-index-math/set-matrix-zeroes" },
   { from: "/74", to: "/binary-search/search-a-2d-matrix" },
   { from: "/78", to: "/backtracking/subsets" },

work/1/Easy/Math/70.climbing-stairs.py

@@ -0,0 +1,53 @@
+"""
+70. Climbing Stairs
+Difficulty: Easy
+https://leetcode.com/problems/climbing-stairs/
+
+──────────────────────────────────────────────────
+
+You are climbing a staircase. It takes n steps to reach the top.
+
+Each time you can either climb 1 or 2 steps. In how many distinct
+ways can you climb to the top?
+
+
+
+Example 1:
+
+Input: n = 2
+Output: 2
+Explanation: There are two ways to climb to the top.
+1. 1 step + 1 step
+2. 2 steps
+
+Example 2:
+
+Input: n = 3
+Output: 3
+Explanation: There are three ways to climb to the top.
+1. 1 step + 1 step + 1 step
+2. 1 step + 2 steps
+3. 2 steps + 1 step
+
+
+
+Constraints:
+
+        • 1 <= n <= 45
+"""
+
+
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        if n == 1:
+            return 1
+        if n == 2:
+            return 2
+
+        first, second = 1, 2
+
+        for _ in range(3, n + 1):
+            third = first + second
+            first, second = second, third
+
+        return second