midRecursion

The Tower of Hanoi problem using recursion.

Updated Apr 28, 2026

Short answer

Moving n disks from source to destination using an auxiliary peg via recursive logic.

Deep explanation

Intermediate recursion focuses on optimization and advanced patterns like backtracking. Moving n disks from source to destination using an auxiliary peg via recursive logic.

Real-world example

File system crawlers (scanning directories and sub-directories).

Common mistakes

  • Thinking all recursion is tail-recursive
  • the result must not depend on local calculations after the call.

Follow-up questions

  • Does Python support TCO?

More Recursion interview questions

View all →