GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesStaircase Climber

Gamified challenge · Dynamic programming

Staircase Climber

A staircase has n steps. Each move takes you up 1 step or 2 steps. Two climbs are different if their sequences of moves differ, so 1+2 and 2+1 count separately.

Write ways(n) that returns how many different climbs reach exactly step n. For n = 0 there is exactly one way (stand still). For n = 3 the answer is 3: 1+1+1, 1+2 and 2+1.

n is between 0 and 45, so the answer always fits in an int.

Sign in to play Staircase Climber

This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.

Sign in with Google

or log in with email · create an account