Ways to Climb Stairs

Talk it through with a coach who asks guiding questions and gives hints until you reach the answer. Pass to mark the challenge as completed.

The problem

  • easy

You climb a staircase of n steps, taking either one or two steps at a time. How many different ways can you reach the top? Explain how you'd work it out, why the plain recursive solution is slow, and how to fix it.

Talk this problem through with an AI coach

Sign in with Google to start a free voice session — no credit card needed.

Start free →