Back to Questions

Climbing Stairs (Dynamic Programming)

110K views•Asked at Uber•
Easy

Question Explain

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?

Start Trying This Question Simulation

Practice answering orally or with text to get instant AI feedback.

Practice with This Question

Other interview questions like this

Two Sum

104.4K views

Longest Substring Without Repeating Characters

62.2K views

Median of Two Sorted Arrays

107.8K views
Climbing Stairs (Dynamic Programming) - Interview Question