Status: IN
`climbStairs(n)` computes the (n+1)th Fibonacci number — the problem is isomorphic to Fibonacci computation with base cases fib(1)=1, fib(2)=2.
Source: entries/2026/06/06/climbing-stairs-solution.md
JSON