diff --git a/ToweofHanoi.java b/ToweofHanoi.java
new file mode 100644
index 0000000..fbdb182
--- /dev/null
+++ b/ToweofHanoi.java
@@ -0,0 +1,19 @@
+
+// Time complexity = O(2^n-1)= O(2^n)
+
+public class TowerofHanoi {
+    public static void towerofHanoi(int n, String src, String helper, String dest){
+        if (n==1){
+            System.out.println("Transfer disk "+n+" from "+src+" to "+dest);
+            return;
+        }
+        towerofHanoi(n-1, src, dest, helper);
+        System.out.println("Transfer disk "+n+" from "+src+" to "+dest);
+        towerofHanoi(n-1, helper, src, dest);
+    }
+    public static void main(String[] args) {
+        int n = 7;
+        towerofHanoi(n, "S", "H", "D");
+
+    }
+}