feat(content): more test cases

backend/data/questions/min-cost-climbing-stairs.yaml

@@ -9,6 +9,24 @@ categories:
 patterns:
   - dynamic-programming
 
+function_signature: "def min_cost_climbing_stairs(cost: list[int]) -> int:"
+
+test_cases:
+  visible:
+    - input: { cost: [10, 15, 20] }
+      expected: 15
+    - input: { cost: [1, 100, 1, 1, 1, 100, 1, 1, 100, 1] }
+      expected: 6
+    - input: { cost: [0, 0, 0, 0] }
+      expected: 0
+  hidden:
+    - input: { cost: [1, 2] }
+      expected: 1
+    - input: { cost: [10, 15] }
+      expected: 10
+    - input: { cost: [1, 100] }
+      expected: 1
+
 description: |
   You are given an integer array `cost` where `cost[i]` is the cost of the i<sup>th</sup> step on a staircase. Once you pay the cost, you can either climb one or two steps.