{"id":"climbing-stairs-is-fibonacci","text":"`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.","truth_value":"IN","source":"entries/2026/06/06/climbing-stairs-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"climbing-stairs-is-fibonacci","truth_value":"IN","reason":"premise"}]}}