LeetCode 70: Climbing Stairs — Step-by-Step Visual Trace

Easy — Dynamic Programming | Math | Fibonacci The Problem Given n stairs, find the number of distinct ways to climb to the top where you can climb either 1 or 2 steps at a time. Approach Use dynamic programming with space optimization by recognizing ...