9. Towers of Hanoi -Recursion- Algorithmic Problem solving-

[@manvendrasingh3015]

u are the first person to explain it in such simple terms thanks a lot ma'am

[@preethij427]

It's my pleasure

[@Vasanth_707]

Excellent 🎉🎉🎉

[@preethij427]

Thank you for taking the time to watch my KZbin videos and leaving your comments.

[@komalyadav917]

Thank youuu ma'am 🎉 ....u have explained it easily

[@preethij427]

My pleasure 😊

[@abdulrazakbaimbakamara6867]

Thanks for the help me to understand Tower of hanoi

[@eagle4338]

Maa'm, your teaching style is amazing

[@preethij427]

Thank you

[@naveenpandian1299]

The best explanation and better than my python mam

[@preethij427]

Thank you for your feedback! I'm glad you find my explanations helpful.

[@kalpanan2981]

Well explained🎉

[@preethij427]

Glad it was helpful!

[@mahalaxmiv634]

Thank you mam, you teaching way is very good, and plz share vedios on motivation to students

[@preethij427]

Will upload soon

[@MohammedShameel-e7y]

Thank-you mam I have understand clearly 😊😊

[@preethij427]

Glad to hear that

[@Itloo-g2n]

Superrrrrrrr mam

[@preethij427]

Thank you

[@anilsanny7430]

THANKS FOR HELPING ME OUT THIS VIDEO HELPS ME BETTER TO UNDERUNDERSTAND 🥰🥰❤❤

[@preethij427]

Happy to help!

[@DilipKumar-pd7wn]

Mam you explained clearly thank you so much. please come to my college. You worth and brilliant compare to my whole College teachers. 16:54

[@TenzingNamsay]

13:26 how can we move 2 disc at the same time????

[@Ikra-yj9zf]

Same doubt

[@KTMGopiyadav]

Thank you Preethi madam

[@preethij427]

Welcome

[@tehniatmirza1439]

Plz explain how the elements are picked , compared and stored recursively.

[@KrishnaKukreja-h4r]

very nice thank you very much

[@preethij427]

You are most welcome

[@NagarajS-hn6il]

Thank you soo much 🎉

[@preethij427]

You’re welcome 😊

[@VeluchamyMuthusamy-ly9xm]

Super🌺🌺

[@preethij427]

Thank you

[@onlyeductionpraveen8586]

Super mam

[@preethij427]

Thank you

[@shaheenAbbas-p1m]

great

[@preethij427]

Thank you

[@AyushKumar-rs2sf]

:-} well explained

[@preethij427]

Thank you

[@LakshmiPriya-m3l]

Super mam😊

[@preethij427]

Thank you

[@yasserhussain2001]

U make very easy and understandable Thanku mam ❤

[@preethij427]

Thank you for your comment! I'm glad you find the content easy to understand. Your feedback means a lot!

[@SachinGupta-vn5mf]

Easily explained 💯🔥

[@preethij427]

Thank you very much for leaving the comment… Glad that u found the content helpful…

[@PUNITHBARATH-rv7yt]

thank you ma'am 🎉🎉🎉🎉🎉🎉❤❤❤❤

[@preethij427]

Welcome… Happy learning

[@fatima-cf1bj]

thank you so much

[@preethij427]

You're welcome!

[@rmxpassports3016]

I am in 11th and have no plans in taking CS, yet I don't know why I am watching this so intrestingly

[@preethij427]

Thank you..

[@Tryforthisday]

I am Watching Lot of Video but not clear concept but one video all doubt clear one video

[@preethij427]

Thanks a lot

[@Nikhil_Gosavi2002]

great explained

[@preethij427]

Thank you! I appreciate your positive feedback.

[@prasadkattunga6711]

🎉

[@preethij427]

Thank you

[@msyadavar8928]

But mam you told we can't move two disk at a same time

[@preethij427]

You're absolutely right! In the Towers of Hanoi puzzle, you can only move one disk at a time. Each move involves transferring the top disk of any tower to another tower, following the rules of the game. In the video, I have moved one disk at a time only, but for the time constraint, I have shortcut the video and posted it

[@prafullmohadikar2803]

i m confused everyone explained same 2 disk shifting at one time

[@preethij427]

In the Towers of Hanoi puzzle, only one disk can be moved at a time. Each move involves taking the top disk from one stack and placing it on another stack. To keep the video short, it might look like multiple disks are moving at once, but in reality, each disk is moved one by one according to the rules.

[@divyar1557]

Very well explained mam.me pida ho ga.

[@preethij427]

Thank u very much.. Glad that u found the content useful…

[@MuthamizhanMuthamizhan-k1f]

Nice name

[@shreyanpradhan5467]

But mam we can move only one disk not two disk pls check that

[@preethij427]

In the Towers of Hanoi problem, you can only move one disk at a time, and a larger disk cannot be placed on top of a smaller one. The objective is to move all the disks from one rod to another, using a temporary rod, while following these rules. It's a classic problem often used to illustrate recursion in programming. In the given video, I have moved only one disk at a time and I have clubbed the two steps and displayed..

[@kick4089]

Pseudo code please

[@Thannila.G]

Thankyou mam

[@preethij427]

Thank u for watching and leaving the comments