0:00
Climbing Stairs
Easy
Dynamic Programming
Math
Fibonacci

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?

Examples:

Input:2
Output:2
Explanation: There are two ways to climb to the top: 1. 1 step + 1 step, 2. 2 steps
Input:3
Output:3
Explanation: There are three ways: 1. 1 step + 1 step + 1 step, 2. 1 step + 2 steps, 3. 2 steps + 1 step

Constraints:

  • 1 ≤ n ≤ 45
Code Editor
Loading advanced editor...
Console Output

Ready to execute

Click "Run Code" to see your output here