Y
YeetCode
Dashboard
/
1-D Dynamic Programming
/
Climbing Stairs
Easy
#70
Fibonacci DP
Climbing Stairs
Count the number of ways to climb n stairs (1 or 2 steps at a time).
Solve on LeetCode
↗
Full Explanation
Next
House Robber →