Climbing Stairs · Coding Interview Practice

Climbing StairsYou are climbing a staircase with n steps. Each time you can climb 1 or 2 steps. How many distinct ways can you climb to the top?Constraints

1 <= n <= 45

Examples

Input: n = 2 Output: 2

Input: n = 3 Output: 3

Input: n = 4 Output: 5

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…