Roadmap DSA Tracker Code Editor Tech Blogs

Loading question...

The ultimate platform to master JavaScript interviews. Comprehensive questions, interactive practice, and detailed explanations.

Explore

Home
Practice Arena
Browse Topics
All Questions

Resources

Learning Roadmap
Cheatsheets
Tech Blog
Community

Stay Updated

Get the latest interview questions and tips delivered to your inbox.

Join 5,000+ developers

© 2026 JS Interview Prep. Made withby developers.

Privacy Terms Cookies

Buy Me A Coffee

Climbing Stairs

Easy

00:00

0 users online

You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Sample Input:

Sample Output:

Hints

Hint 1

This is a Fibonacci sequence problem

Hint 2

Use dynamic programming

Hint 3

ways(n) = ways(n-1) + ways(n-2)

Code Editor

Loading...