~/boss / golden-disks
Recursion
The Doom Tower
Move the tower one disk at a time, never big on small. Follow the call stack.
Loading the fight…
How to beat it
To move n disks, move the n-1 smaller ones out of the way, move the biggest, then move the n-1 back on top. Moving the n-1 is the same puzzle, smaller, so it calls itself. Every extra disk doubles the moves.
Now the real boss
Interviews ask for the code. Watch it run, then write it yourself, tested in Python, C++ or Java.
On your phone? Writing code is easier on a laptop: open bossfight.dev/problems/tower-of-hanoi there. Sign in with your email to keep your progress on every device.