[Computer Networks] Climbing Stairs DP

Question

Problem Statement for Climbing Stairs DP under Computer Networks:

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?

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def climbStairs(n):
    if n <= 2:
        return n
    dp = [0] * (n + 1)
    dp[1] = 1
    dp[2] = 2
    for i in range(3, n + 1):
        dp[i] = dp[i-1] + dp[i-2]
    return dp[n]
```

[Computer Networks] Climbing Stairs DP

Problem Statement

Proposed Solution

Your Progress

Save Progress?