Climbing Stairs Ways | Dataford Interview Questions

How many ways are there to climb stairs if you can take either 1 step or 2 steps each time?

Implement climb_stairs(n), which returns the number of distinct step sequences for exactly n stairs. Treat climb_stairs(0) as 1 way, representing taking no steps.

Constraints

0 <= n <= 45
Each move advances exactly 1 or 2 stairs
Return an integer count

Function Signature

def climb_stairs(n):

Your question is Climbing Stairs Ways. 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

How many ways are there to climb stairs if you can take either 1 step or 2 steps each time?

Implement climb_stairs(n), which returns the number of distinct step sequences for exactly n stairs. Treat climb_stairs(0) as 1 way, representing taking no steps.

Constraints

0 <= n <= 45
Each move advances exactly 1 or 2 stairs
Return an integer count

Function Signature

def climb_stairs(n):

Your question is Climbing Stairs Ways. 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.