Program to solve the Tower of Hanoi problem using recursion in Java

Programs/TowerOfHanoi.java

@@ -0,0 +1,24 @@
+// Program to solve the Tower of Hanoi problem using recursion in Java
+
+class TowerOfHanoi{
+
+    public static void towerOfHanoi(int n,String src,String helper,String dest){
+        if(n==1){
+            System.out.println(src+"->"+dest);
+            return;
+        }
+        //transfer top n-1 from src to helper usingdest as 'helper'
+        towerOfHanoi(n-1,src,dest,helper);
+        // Move nth disk from src to dest
+        towerOfHanoi(1,src,helper,dest);
+        // Transfer n-1 disks from helper to dest using src as helper
+        towerOfHanoi(n-1,helper,src,dest);
+    }
+
+
+    public static void main(String args[]){
+        int n =3;
+        towerOfHanoi(n,"A","B","C");
+
+}
+}

README.md

@@ -126,7 +126,7 @@ It is very easy to contribute, you may follow these steps -
 99.[RotateLinkedList](https://github.com/PrajaktaSathe/Java/blob/main/Programs/RotateLinkedList.java)-Program to demo rotating a linked list
 100. [ReverseString](https://github.com/PrajaktaSathe/Java/blob/main/ReverseString.java) -Program to reverse a String using the java method substring.
 101.[Overriding](https://github.com/PrajaktaSathe/Java/blob/main/Programs/Overriding.java)-Program to demo overriding in java
-
+102.[Tower Of Hanoi](https://github.com/PrajaktaSathe/Java/blob/main/Programs/TowerOfHanoi.java)-Recursive solution for Tower of Hanoi problem in Java.
 # Contributors - 
 ## A big thank you to all our contributors!!!