Stairs Routes Counting | Dataford Interview Questions

Write a function to calculate the number of possible routes to climb N stairs, given that you can only make a 1-step and a 2-step.

Implement climb_stairs(n), which accepts a non-negative integer and returns the number of distinct ordered sequences of 1-step and 2-step moves that reach exactly stair n. Treat n = 0 as one valid route: taking no steps.

Constraints

0 <= n <= 100
n is an integer
A route must reach exactly stair n
The order of moves distinguishes routes

Function Signature

def climb_stairs(n):

Your question is Stairs Routes Counting. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write a function to calculate the number of possible routes to climb N stairs, given that you can only make a 1-step and a 2-step.

Constraints

0 <= n <= 100
n is an integer
A route must reach exactly stair n
The order of moves distinguishes routes

Function Signature

def climb_stairs(n):

Your question is Stairs Routes Counting. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.