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 challengesTower of Hanoi

Gamified challenge · Recursion

Tower of Hanoi

Discs 1 to n (1 is the smallest) are stacked on peg A, largest at the bottom. Move the whole tower to peg C, one disc at a time, taking the top disc of a peg and never putting a larger disc on a smaller one. Peg B is there to help.

Write hanoi(n) that returns the moves in order, each as "X Y" (from peg X to peg Y), using the fewest moves: 2n - 1. For n = 2 that's ["A B", "A C", "B C"].

Sign in to play Tower of Hanoi

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