Dev
Mentor
Coach Interview AI
Mock Interview AI
Coding Problems
Blog
Pricing
Toggle theme
Sign In
Get Started
Toggle theme
Loading...
Loading...
Climbing Stairs — Coding Practice | DevMentor
For the best coding experience, use a desktop browser.
Easy
Dynamic Programming
Climbing Stairs
Count distinct ways to climb n stairs taking 1 or 2 steps.
Examples
Input:
n = 3
Output:
3
Sample Test Cases
Case 1 Input:
3
Expected:
3
Case 2 Input:
2
Expected:
2
Reset
Run
Submit
Loading editor...
Test Case
Output
Submission
Case 1 Input:
3
Expected:
3
Case 2 Input:
2
Expected:
2