✅Tower of Hanoi(Contest)

Tower of Hanoi easy asked in interviews by 2 companies Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

From wiki- The Tower of Hanoi is a mathematical puzzle where we have 3 rods and N disks. The puzzle starts with all the disks in ascending order of size on the first row. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod. 3. No larger disk may be placed on top of a smaller disk. -----x--x--x------ Let the rods have names A, B and C. Given N number of disks, numbered 1 to N from top to bottom, display all the moves required to move the disks from rod A to C in minimum number of steps.InputThe only line of input contains an integer N denoting the number of disks Constraints: 1 ≤ N ≤ 16OutputPrint sequence of moving disks, where each move is shown in the following format- {DiskNumber}:{FromRod}->{ToRod} Each move in the sequence is separated by a new lineExampleInput 2 Output 1:A->B 2:A->C 1:B->C

link:https://my.newtonschool.co/playground/code/qxqq6mscuttf/

```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        TOH(n,'A','C','B');
    }
    static void TOH(int n, char A, char C, char B){
        if(n==0){
            return;
        }
        TOH(n-1,A,B,C);
        System.out.println(n + ":" +A + "->" + C);
        TOH(n-1,B,C,A);
    }
}
```