Write a program to solve the Tower of Hanoi problem for n disks.
HardProblem Statement
Write a program to solve the Tower of Hanoi problem for n disks.
Sample Input
n = 3
Sample Output
Move disk 1 from A to C Move disk 2 from A to B Move disk 1 from C to B Move disk 3 from A to C Move disk 1 from B to A Move disk 2 from B to C Move disk 1 from A to C
Limits
Time: 2s · Memory: 256 MB
Code Editor
00:00
function towerOfHanoi(n: number, source: string, target: string, auxiliary: string): void {
// Your logic here
}
Input
n = 3
Expected Output
Move disk 1 from A to C Move disk 2 from A to B Move disk 1 from C to B Move disk 3 from A to C Move disk 1 from B to A Move disk 2 from B to C Move disk 1 from A to C