Back to QuestionsPractice with This Question
Climbing Stairs (Dynamic Programming)
110.1K 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.