Staircase Ways Counting | Dataford Interview Questions

How many different ways can you reach the nth stair if you can take either one or two steps at a time?

Implement climb_stairs(n) to return the number of ordered step sequences that reach stair n, with climb_stairs(0) = 1. For example, n = 2 returns 2 and n = 5 returns 8; assume 0 <= n <= 50 and return an integer.

Constraints

0 <= n <= 50
Each move advances exactly 1 or 2 stairs
The result fits within Python's integer representation

Function Signature

def climb_stairs(n):

Your question is Staircase Ways 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

How many different ways can you reach the nth stair if you can take either one or two steps at a time?

Constraints

0 <= n <= 50
Each move advances exactly 1 or 2 stairs
The result fits within Python's integer representation

Function Signature

def climb_stairs(n):

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