0 XP · 0 scenes

Climbing Stairs

EasyDP: ways to here = ways from one step below + from two below
Open on LeetCode ↗

1Try it yourself first

00:00

Think for 20-30 minutes before you open any hint. Being stuck is where the learning happens.

Only for you, saved in this browser. After you see the approach you will compare it with your idea.

2What is being asked

You climb n stairs taking 1 or 2 steps at a time. In how many distinct ways can you reach the top?

How to recognise itThe last move was either a 1-step or a 2-step, so ways(n) = ways(n - 1) + ways(n - 2).

3Hint ladder

Take one rung at a time. Stop as soon as the idea clicks.

  1. Hint 1
  2. Hint 2

4The approach

Have you tried the hints? The approach is built as a path from the obvious way to the clever one.

✓After you finish

Confidence