Skip to interview prep
Apexed

72. Solve the Tower of Hanoi recursively. How many moves does it need for n disks?

EasyRecursion & backtracking

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

Solve the Tower of Hanoi recursively. How many moves does it need for n disks — Data structures & algorithms interview question — Apexed