The Staircase Problem
A medium Python mock interview question on DataDriven. Practice with AI-powered feedback, real code execution, and a hire/no-hire decision.
- Domain
- Python
- Difficulty
- medium
- Seniority
- L4
Interview Prompt
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.
How This Interview Works
- Read the vague prompt (just like a real interview)
- Ask clarifying questions to the AI interviewer
- Write your python solution with real code execution
- Get instant feedback and a hire/no-hire decision