Climbing Stairs (Dynamic Programming)

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

Click "Start Speaking" and answer the question naturally.