Tower of Hanoi: How Many Moves — Solution & Editorial

Back to the Problem

The recurrence T(n) = 2T(n−1)+1 telescopes to 2^N−1.

Complexity: O(1)