Climbing Stairs — Easy DSA Problem

Problems/70. Climbing Stairs

⌥

Visualizer will appear here

1def climb_stairs(n):

2 if n <= 1:

3 return 1

4 dp = [0] * (n + 1)

5 dp[0] = 1

6 dp[1] = 1

7 for i in range(2, n + 1):

8 dp[i] = dp[i - 1] + dp[i - 2]

9 return dp[n]

Visualizer

⌥

Visualizer will appear here