The Staircase Problem

A medium Python interview practice problem on DataDriven. Write and execute real python code with instant grading.

Domain

Python

Difficulty

medium

Seniority

L4

Problem

Given a positive integer n, return the number of distinct ways to climb n stairs taking 1 or 2 steps at a time. The answer is the (n+1)-th Fibonacci number.

Summary

One step or two, the choices add up.

Practice This Problem

Solve this Python problem with real code execution. DataDriven runs your Python code in a real environment and grades it automatically.