Climbing Stairs
You are climbing a staircase. It takes n
steps to reach the top.
Each time you can either climb 1
or 2
steps. In how many distinct ways can you climb to the top?
Example 1:
Example 2:
Constraints:
1 <= n <= 45
Solutions
🧠 Cpp
Last updated
Was this helpful?