66. Climbing Stairs

EasyDynamic Programming

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: 8

Output: 34

Explanation: Public test case for Climbing Stairs

Constraints

  • 1 <= n <= 45
Loading...

Run checks all cases above. Submit evaluates all test cases.