Meet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start Part 1 to unlock your next challenge
Climbing Stairs
Count the ways to reach the top when you can take 1 or 2 steps at a time. It looks like a brute-force recursion problem, but it's actually your first real dynamic programming question. Once you see the Fibonacci pattern hiding inside, a whole category of DP problems clicks into place.
Chat with Fin or Coco right now on mobile.
Start talking through the problem here. Switch to desktop when you're ready to code and run tests.
Start coaching sessionMeet your coaches
Talk through the problem while you code. Guest text is free. Hosted voice is the Own Words Pack.
Start a coached rep now. Guest text is free. Sign in if you want this work on another device.
Email me this coached-rep link
Start Part 1 to unlock your next challenge
Code + tests need a desktop
Chat works on this phone. Email yourself a link when you want the editor and tests.