Climbing Stairs
Easy
1-D DP
•
Grind 75NeetCode 150
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?

Constraints:

  • 1 <= n <= 45