Tower of Hanoi | Recursion

The tower of Hanoi is a famous puzzle where we have three rods and N disks. The objective of the puzzle is to move the entire stack to another rod. You are given the number of discs N. Initially, these discs are in the rod 1. You need to print all the steps of discs movement so that all the discs reach the 3rd rod. Also, you need to find the total moves.
Problem Description: practice.geeksforgeeks.org/pr...
The Notes that I taught in the video and the Working Code (if any) will be available on my Patreon page under the "Notes, Code And Support" tier.
Link: / adityaverma
Video Pdf Notes: / 38704739 .
------------------------------------------------------------------------------------------
Here are some of the gears that I use almost everyday:
🖊️ : My Pen (Used in videos too): amzn.to/38fKSM1
👨🏻‍💻 : My Apple Macbook pro: amzn.to/3w8iZh6
💻 : My gaming laptop: amzn.to/3yjcn23
📱 : My Ipad: amzn.to/39yEMGS
✏️ : My Apple Pencil: amzn.to/3kMnKYf
🎧 : My Headphones: amzn.to/3kMOzM7
💺 : My Chair: amzn.to/385weqR
🛋 : My Table: amzn.to/3kMohtd
⏰ : My Clock: amzn.to/3slFUV3
🙋🏻‍♀️ : My girlfriend: amzn.to/3M6zLDK ¯\_(ツ)_/¯
PS: While having good gears help you perform efficiently, don’t get under the impression that they will make you successful without any hard work.

[@atulpant6369]

Priest logo n bolo thoda zyada hora h but its ok 😆😆😆 Great content as usual 👍

[@TheAdityaVerma]

😅😅 Thanks !!

[@ps7072]

😂😂

[@ru2979]

😂🤣🤣🤣

[@pprathameshmore]

Yeah sahi tha!

[@anonmityslayer]

How casually bhaiya said this 😅😅😅

[@sambhute1991]

Every time I do a recursion problem: My Time Complexity: " Thoda jyada ho rha hai par thik hai"

[@tarunstv796]

kzbin.info/www/bejne/jHSXh2ltppeee80

[@CodingEnv]

Brahmaji bole "coding kar lo , placement aa raha hai". You are the best teacher. The way you explain the complex concepts in simple manner, it is really amazing. Thanks a lot.

[@sumitkeshav4718]

Bhai u will revolutionize the teaching standards on youtube!!!. Well for me, i think you have already done it. Hats off bro.

[@ronitkumar19]

Mark the words ...one of the best playlist available for recursion!!!! :)

[@AnkushKumar-mk8ns]

Others: Tower of hanoi. Aditya verma: Tower of brahma.😂 Thank you sir for making this playlist. I hope, further we will get more content. 🙏

[@basketballlove1540]

Your teaching style is just amazing. Please keep uploading this type of amazing content.

[@Amitkumar-fo1lv]

6:40 bahut pitogee... 😂😂 bhramaji rocked..!

[@TheAdityaVerma]

😅 Bhramaji's Thug Life

[@ManuSingh-lt8wr]

😂🤣

[@anniebhalla1237]

Recursion is seriously magic!! And the way you explain it is so amazing !

[@googlepay4295]

but im getting demotivated .. not able to solve any questions from past 25 days

[@nopecharon]

@@googlepay4295 Don't play PUBG

[@googlepay4295]

@@nopecharon seriously bro ....its jus name 🤣🤣🤣

[@googlepay4295]

My younger did this

[@ajitdhayal1612]

Brahmaji bhi coding kerte the😂😂

[@TheAdityaVerma]

😅😅

[@TheAdityaVerma]

Brahmaji ki Jay 🙏🙏❤️

[@shivamshaw5867]

Aur hum bhi karenge☺️☺️☺️

[@akashpurbia4390]

he created universe(brahmaand) so yes.

[@sankalparora9261]

yeah, that was good.

[@mayankguptacse5904]

Never came across such a unique way of teaching things. Thanks for such a great content . Brahmaji ki Jay :)

[@aniketmore7409]

great job bro!!! you've very unique and great way of teaching things!! you made such complex things so easy !! I appreciate it bro !!

[@ShabnamKhan-cj4zc]

Thank you very much for this video as you are the only one who explained why disk needs to move from source to helper first instead of making statement that it has to be moved. Thanks again for focussing on explaining the logic instead of memorize something.

[@entc_khushalnikam8124]

Was stuck at this problem from so long . Great explanation . Thank you for these ❤️

[@shaikirfanameer359]

bhai how u r teaching in unique manner i think u were blessed with it

[@TheAdityaVerma]

Thanks brother, just developed my own way of learning things !! 😅

[@shaikirfanameer359]

I watched ur every video but today i felt like if i comment today u'll reply me Finally it Happened 😍

[@TheAdityaVerma]

Haha, even if I am unable to reply to every comment on the channel. I make sure to read each and everyone of them !! So don't worry brother, your blessings and comments are reaching out to me. ❤️

[@divyanshuyadav5524]

@@TheAdityaVerma sahi h ❤️

[@visheshagrawal8676]

From a long time I couldn't able to understand this problem but I got confidence to solve problems similar like this... really improved my way of thinking of recursion

[@jatinoza3099]

Wow, TBH now i am getting a great confidence in this recursion... really great playlist

[@kamalkumar7133]

sir u r great. GFG waalo ne dimag ka dahi kar diya thaa aapne achcha sikhaya.🤩🤩

[@reckonmazumdar3063]

This is some next level way of teaching !!!

[@AmarMishra]

Great visualization in explaining this. Visualization will help retain the problem. Thanks.

[@babitas5381]

you've made life easier for me this is pure gold content, thanks a lot bhaiya 😊

[@ananysharma9290]

Sir Again You explained it in a Really Great manner , love your Channel , Please please Upload Graphs Too

[@tomriddle2427]

Aditya... Man you have a great knack of storytelling and that's the reason why you teach so very well. Loved the story... Never have heard it before and the way you narrated it seriously I laughed for like whole of that story time 😂. Thanks a lot.

[@priyaanshhuu]

this was never so easy to understand aditya bhaiya, you really meant it when you said you would convert us into jedis of recursion, thankyou for doing what you're doing!! :D

[@shailypatel585]

Grate i don't have word to thank you Bro!! mene bhot sare videos dekhe par kisise bhi smj nai aaya even gate ki preparation m bhi sir ne pdaya lekin smj nai aaya but because of you I understood it very clearly !! thank you so much

[@sahilanand30]

What a explanation 🔥 Hats off ♥

[@Ashish123]

thanks a lot mere bhai for the explanation of the code because i was confused how its code work but now you have cleared all my doubts :-)

[@kaanchacheena8087]

Great way of teaching, keep going brother !!!

[@ntesla5]

wonderful explaination as usual

[@aryapandey4576]

And then he said "to priest logo ne bola, "yaar ye thoda zyada ho rha hai par chalo okay"" Couldn't help laughing xDD Your content is so easy to understand :")

[@aashishsah2110]

Just Checked out your channel!! Hope you become a better coder and KZbinr than aditya!✌️

[@aryapandey4576]

Haha, maybe in another world, thanks for checking out! Means a lot :)

[@vrajupadhyay4755]

amazing teaching way of yours thank you.

[@vibhutiagrawal5105]

The most hilarious line for me was, brahma ji ne bola, 'choti plate ke upar badi plate mat rakh dena bohot pitoge' XD. You make this too fun bhai

[@human75788]

Outstanding Teaching!

[@shubhankarmane3172]

This is the best video on Towers of Hanoi.

[@ritikgalgate7783]

Sir mene bhot sare videos dekhe tower of hanoi k lekin mujhe samajh nhi aa rha tha . apka video dekh k mujhe ache se samajh aa gaya .thank you sir

[@AbhishekGupta-cr1mf]

Bahut Behtarinnnn.... tarike se samjh Aa gya , Aaditya BHai 👍👍😎😎 ->> KOi gold medal do Inko 😆

[@nishanb9721]

Great content 🔥

[@kumarirashmi6828]

Thank u bhaiya for such a wonderful explanation

[@armaankashyap366]

Nyccc bro mene abhi bahut jagah se samjha iska code but meko yaha se clear ho gaya thanku bhaai 🤗

[@harshvardhandixit5046]

Thanks a lot I'll never have to memorize the TOH code ever again!

[@ChandanKumar-wf5sx]

Pahali baar kisi ne TOH itne unique aur easy way me samjhaya.. Thanks Aditya bhaiya.. (Aap hamare liye Bramhaji ke Priest ho)

[@RicheshGuptaRichu]

video bnana khtm kr doge to universe waps restart ho jaegi

[@arbaajkhan4591]

Bhai level h seriously , amazing 💯💯

[@utkarshgautam1940]

code padhne m aur samjane m fark hota hai ,this is is teching how to write code,@Aditya bhiya love u

[@sachetansabhahit6235]

TOB was never this easy bro. Hats off

[@aadil4236]

The best part about the video was the Bhrama story. I loved it. What an amazing story. I heard a story about where a Peasent goes to a King for some rice. So the King asks how much rice does he needs. The Peasent says he needs a single grain of rice for each square in a chess board. The only condition is that you have to double the rice of grain each time you go to a new square. The King was a fool so he agreed to the deal. 2^64 grain of rice is quite much. How much? Well as a proud/weird nerd I went to the internet to find the answer. As it turns out 2^64 grain of rice is roughly equivalent to a millennium(1000 years) of our entire plantes rice production. Yikes!!

[@Bharat_Rider]

Great video 👍👍

[@kush3764]

Thank you bhai especially for the Amazing story...

[@NiteshKumar-dn4em]

Bhaiya aap same Love Babbar ki tarah samjhate ho....dono hi ek dam OP ho...concept crystal clear ho jate h🙌

[@rashikakurhade3499]

Well I must say anyway good teacher is a great story teller. Look at you!!

[@babbarutkarsh7770]

Bhai feel aa gyi aaj.🔥

[@kailashchandra2666]

one of the best technique......Best mentor🤩🤩🤩🤩🤩🤩

[@manavkampani594]

This is the funniest video of the series till yet.

[@degavathanandnayak9692]

Great explanantion!

[@harshalgarg1149]

So helpful. 😍

[@kishanmishra9802]

Great teacher

[@666_kanishkanarayan3]

18:29 previously when you pass the first argument as n, then how are you receiving with int s which has been given for starting point and n is for no. of plates.

[@RohitSharma-hd4me]

me - which compiler do you use ?? brahma ji - priest

[@hope-jh7bv]

Thank you so much sir.

[@ExplooreWithManoj]

Nice explanation...

[@vishalgupta9620]

I have a question , this was a little complex solution that had too many variables to track for dry running this code on paper but that didn't matter because of recursion and we solved it easily if we come across a rec code of similar type and had understand it without compiling it can we do it like we solved it (from n to n-1 i mean ) will that be ok

[@sumitsaini589]

Hahaha Nice concept man xD Love your videos ;)

[@kairatopa9564]

Great bro

[@shubhampokhriyal8491]

Awesome bhaiya

[@usmanaliansari5223]

for count we can directly print that using maths i.e. n disks can be solved in minimum 2^n−1 steps.

[@roushanraj8530]

#storytelling awesome bhaiya 😍😍 Brahmaji apne aditya bhai ko ye task dete, ek program me khel khtm, 😅😅

[@hrithikdhanraj2919]

.Achcha hai nhi diya wrna sab chutkiyo me finish

[@nopecharon]

You are the best teacher

[@deepthiacharya9991]

Thank you sooo much sir🥺❤

[@charanreddy5227]

is this algorithm applicable for 4 discs? For the four discs problem we will use source aswell for the transferring the discs.

[@sumitapathak2900]

"zyada ho rha hai par kar lenge" was 😅😂 Amazing lecture

[@PythonGuruji]

bro mouse se itni jldi likh lete ho ya fr touch pad laptop ka??

[@rishikeshkumarsingh3283]

maza aa gya story sun ke..

[@amartyadas5-yriddmechanica597]

Today I understood the term "Recursion works like magic"

[@jayantkumar4-yearb.tech.ci302]

Brahma ji v coding karte the , toh chalo hamlog v karte h. hamlog toh Aditya bhai aapkji wajah se kar paa rhe h Thanks bro..

[@worldcitizen7890]

bohot zabardast video hai bhai...bas agli bar thoda short rakhna best of luck

[@msk9414]

The order of plates to be moved is FIFO i.e 2nd, 3rd, 4th plate from bottom. The poles are not representing stack.

[@mrdevtelugu]

Wah I loved the introduction

[@sarthaktomar4686]

Real power of recursion!!!!!!!!!💪💪💪💪

[@sanjayjoshi8807]

where did you learn this from because never seen such an explanation like this bro plz tell this bro !! you are amazing liked and subscribed and make a video on books and online material for the best understanding of ds and algo as you used !!!!!!

[@TheAdityaVerma]

haha I didnt learn this from anywhere, as the time passed I started to make my own methods and started to see patterns that were never mentioned anywhere before. You will too, just keep practising.

[@sanjayjoshi8807]

@@TheAdityaVerma okay bhaiya thankyou ! keep growig

[@immagod5285]

Bro this is just💙❤️

[@aasthagoyal5059]

Bhaiya sbse phle jo sbse niche disk hai vo move kregi ya jo sbse upr hai... Jo diagram apne btaya usme last disk move kregi?

[@piyushmishra4988]

bro, which tools you use for video recording and writing?

[@yatinarora1252]

he is using some sort of ipad for writing and for recording it must be kine master

[@alringeorgesabu4391]

Nice bro

[@pranayreddyannam188]

Very Nice

[@bennet615]

sir suppose 3 plates li hai to jab aap 1st plate ko vaps from destination to source bhejoge vo kahan par ho raha hai , vo mujhe smamjh nahi aa raha , could you please explain that

[@ShubhamKumar-lb9lf]

Ismai bhi recursively bottom mai insert ni kr sakte hai kya? Jaise ki stack mai kiya tha

[@caspers8933]

Can anyone suggest me a good course for DSA like this one for other topics

[@hrishikeshmishra-tl7le]

How he is transfering all the plates (n-1) from source to helper without following the two conditions and vice versa ?

[@atulwadhwa192]

At 10:19 For smaller input why can't we pop the top of the stack and then remaining n-1 ele par solve func lagaye and the hypothesis can be moving all n-1 from source to destination and then in the induction step we push the poped element at pole 3. Can someone clear what's wrong with this approach?

[@ArvindYadav-gy7fj]

it cannot be done bcoz when u pop it means u are storing it in any of the one pillar(either helper and destination) and then it cannot be solved for remaining disc by only using one pillar bcoz in the pillar storing the top disc u can't put any other disc as it it is of the least size.

[@sudhanshuraj8632]

might be this story is correct but I am known to the fact that there is only one temple for brahma dev in entire world, and these has many reasons that are there in hindu mythlogy, one is he was cursed to have just one temple, and that is in pushkar, but the explanation was fabulous sir, no one can make it much easier

[@anirudhatole2557]

you gained a sub my friend.

[@himanshumalik6913]

Exact same code in Java: import java.util.*; class Main { public static void main(String[] args) { Scanner scn = new Scanner(System.in); int n = scn.nextInt(); int s = 1, d = 2, h = 3; solve(n , s, d, h); } public static void solve(int n, int s, int d, int h){ if(n == 1){ System.out.println("Moving plate " + n + " from " + s + " to " + d); return; } solve(n - 1, s, h, d); System.out.println("Moving plate " + n + " from " + s + " to " + d); solve(n - 1, h, d, s); } }

[@offensive-brat]

man of culture

[@rakhsanthrakhy1587]

Looks like at the end of this problem Bhrammaji ka recursive stack memory complete hogi and new system(universe) banayega :) :)

[@sajidmanzoor1184]

Solve the following puzzle for Tower of Hanoi · If puzzle can be accomplished in 3 moves with two discs. Use this to work out how many moves would be needed with three discs? · If puzzle can be completed in 15 moves with four discs. Use this to work out how many moves would be needed with five discs? · In general, describe a way of working out how many moves are needed when one extra disc is added? ye kese hoga

[@mohan_792]

2^n - 1; where n == number of discs

[@bismeetsingh352]

This one felt likee magic.

[@sudhanvah3222]

Aditya really apricate the good work, could you please improve the audio qualities of the videos.

[@h6_wingers]

Thank u sir

[@arpanbanejee5143]

sir, induction step main ap cout kar rahe hian moving plate n from A to C. jabki humein pata hain ki ek hi plate bacha hua hain. yeh n plate ka funda samajh nhi aya, pata hain n likh rahe hain tab hi 1, 2, 3 karke print hoga, but apke tarika se wo kaise malum kare ki n likhna hain waha. Baki sab cystral clear hain bas ek yehi hain

[@subratasatapathy3822]

Can't we pop the source stack and push to helper stack(it will be reversed).Then pop the helper stack and push to destination(reversed->reversed: original)?

[@mohan_792]

We can't keep larger discs on smaller discs... If we reverse them, this rule will be violated. So, ....

[@paritoshdadhich2954]

bhramaji bole placement aa raha hai coding karo... bhramaji jaisa bole vaisa hai karne ka :) great content... ab kabhi nahi bhuluga iska solution hahahah