Recurrence Relation for the Tower of Hanoi with n Disks

Company: Apple

Difficulty: easy

Recursion Recurrence Relations Algorithms

More Apple OA questions Interview experiences