Solving Tower Of Hanoi Problem With Recursion

  Рет қаралды 71,042

Coding Ninjas

Coding Ninjas

Күн бұрын

Пікірлер: 55
@CodingNinjasIndia
@CodingNinjasIndia 3 жыл бұрын
Participate In CodeStudio Weekend Contest:www.codingninjas.com/codestudio/contests? Practice Recursion Questions here:bit.ly/2VEOksT
@gantayat
@gantayat 2 жыл бұрын
04:26 : Me while learning DSA.
@allenalex4861
@allenalex4861 2 жыл бұрын
It would have been nice if you could have shown a recursive tree as well.
@lsdxsaurabh2798
@lsdxsaurabh2798 2 жыл бұрын
NO hate but sir kuch bhi samaz nahi aaya.....
@tuntunewala
@tuntunewala 3 жыл бұрын
Just a Joke: Sir:Hanoi problem is super easy............. after sometime : ye kaise hogi sorry😂😂😂😂😂😂😂
@शिवजीकाभक्त
@शिवजीकाभक्त 2 жыл бұрын
🤣🤣🤣
@amangupta4914
@amangupta4914 Жыл бұрын
the sound quality of CN classes are Really Really Really awesome...(kind of appealing).
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Thank you for the kind words!
@lsdxsaurabh2798
@lsdxsaurabh2798 2 жыл бұрын
But you can't move more than one disk at a time..........
@Hoxolotl
@Hoxolotl Жыл бұрын
"if I have n-1 disks, I can assume that I can move the using a helper"... how does this assumption work?
@sanchittripathi1537
@sanchittripathi1537 2 жыл бұрын
i appreciate your hardwork sir and also ,learning from our courses i am from july batch 2022
@CodingNinjasIndia
@CodingNinjasIndia 2 жыл бұрын
Hey Thank you for your kind words! We hope that you found this video informative! You can now get up to 100% Scholarship (Discount) on ALL CODING NINJAS COURSES Using This SCHOLARSHIP TEST. Register Here Now: www.codingninjas.com/landing/scholarship-test/? Stay tuned to Coding Ninjas KZbin channel for more! Happy Learning!
@PriyanshuKumar-bx9oy
@PriyanshuKumar-bx9oy 3 жыл бұрын
Problem solve kahan hua 😅
@vaibhavmurarka5179
@vaibhavmurarka5179 Жыл бұрын
great explanation, just a small tip since you have already made the hint video can you please add it in recursion assignment 1b q5 as well since the hint video is not present there
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Thank you for the kind words!
@saumilaggarwal5233
@saumilaggarwal5233 2 жыл бұрын
thnx for breaking down this problem it is super easy void tower(int n,char source,char helper,char destination){ if(n==1){ cout
@nsg7015
@nsg7015 2 жыл бұрын
i was having problem in understanding this topic, so searched on youtube. thankfully i got the best explanation.
@CodingNinjasIndia
@CodingNinjasIndia 2 жыл бұрын
Hey Nazmus Thank you for your kind words! We hope that you found this video informative! You can now get up to 100% Scholarship (Discount) on ALL CODING NINJAS COURSES Using This SCHOLARSHIP TEST. Register Here Now: www.codingninjas.com/landing/scholarship-test/? Stay tuned to Coding Ninjas KZbin channel for more! Happy Learning!
@yashviPIETCS
@yashviPIETCS Жыл бұрын
it helped! thanksss
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Hey Thank you for your kind words! We hope that you found this video informative! You can now get Scholarship (Discount) on ALL CODING NINJAS COURSES Using This SCHOLARSHIP TEST. Register Here Now: www.codingninjas.com/landing/scholarship-test/? Stay tuned to Coding Ninjas KZbin channel for more! Happy Learning!
@rajji7390
@rajji7390 3 жыл бұрын
Don't understand.
@uuujjwalsquare8991
@uuujjwalsquare8991 2 жыл бұрын
kzbin.info/www/bejne/mKC2ZYFnlLl_eM0
@ALLLLL_IN_ONE
@ALLLLL_IN_ONE 2 жыл бұрын
Same
@saptarsshimukherjee1026
@saptarsshimukherjee1026 Жыл бұрын
The concept he used is wrong how can u place the n-1 part over the biggest disk
@saptarsshimukherjee1026
@saptarsshimukherjee1026 Жыл бұрын
U have to move 1 disk at a time even he doesn't knw what he is talking about
@arunkumaryadav8054
@arunkumaryadav8054 Жыл бұрын
Same here
@ajaywavare9560
@ajaywavare9560 2 жыл бұрын
if u can move n-1 which is 3 disk at once then why u cant move 4 disk directly?
@balbeer_prasad3n
@balbeer_prasad3n 2 жыл бұрын
One disk at a time hi move ho rhi h not 3 .. recursion tree bna k dekh
@shubhamgupta7993
@shubhamgupta7993 3 жыл бұрын
Sir plz make video on placements happening from coding ninja course. It will encourage more people to join and understand the placement scenario in coding ninja.
@aakritiroshan523
@aakritiroshan523 2 жыл бұрын
Thank you sir, understood the explanation perfectly
@CodingNinjasIndia
@CodingNinjasIndia 2 жыл бұрын
Hey, Thanks for the kind words, stay tuned for more interesting videos.
@DTALKS01
@DTALKS01 Жыл бұрын
He is also confused
@suyashrahatekar4964
@suyashrahatekar4964 3 жыл бұрын
Watch reducible' s video on tower of Hanoi for in depth analysis
@shreykabir
@shreykabir 2 жыл бұрын
Best explanation Thnx a lot :)
@Sumer-zt5cu
@Sumer-zt5cu Жыл бұрын
There is a condition we can move only one at a time
@jayaramgautam4890
@jayaramgautam4890 3 жыл бұрын
How can u move three disk at a time
@thisissheraf2633
@thisissheraf2633 2 жыл бұрын
It is recursion moving them one by one, but in recursive call through pseudo code we don’t show three disk moving
@Muwahid999
@Muwahid999 Жыл бұрын
Check out Geeksforgreks animation video of this problem
@swordain
@swordain 2 жыл бұрын
Worse explanation exists?
@azraazra8273
@azraazra8273 3 жыл бұрын
Thanks for teaching in english sir,please continue this
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
@misibusi4932
@misibusi4932 2 жыл бұрын
ok bro sab samjh gya #op #besties
@vinayaksharma-ys3ip
@vinayaksharma-ys3ip 2 жыл бұрын
Thank You Sir!!
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
@zoviostandoff2688
@zoviostandoff2688 3 жыл бұрын
One of my fav questions
@kritisrivastava2102
@kritisrivastava2102 3 жыл бұрын
Great !
@aintEvanescence
@aintEvanescence 2 жыл бұрын
Improve your handwriting sir .. Never thought I would get the chance to say this to a teacher
@akashdubey.consultant
@akashdubey.consultant 2 жыл бұрын
Ankur singla ji was destined to become doctor, accidentally went to IIT :P
@codingdose3399
@codingdose3399 2 жыл бұрын
best explanation i have seen so far. thanks sir
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Hi @codingdose3399 Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
@amish4526
@amish4526 2 жыл бұрын
Thankyou
@CodingNinjasIndia
@CodingNinjasIndia Жыл бұрын
Hi @amish4526 Thank you for the kind words! We hope that this video has helped you! Stay tuned to Coding Ninjas KZbin channel for more such content! Do check our Coding Ninjas Studio, where you can upskill for free and become a Ninja Coder: www.codingninjas.com/studio/home? If reading is your preference, you can find top articles to upskill in your career here: www.codingninjas.com/studio/library? If you would like to opt for a Coding Ninjas course, you can check our courses here: www.codingninjas.com/?
@sameerbairwa681
@sameerbairwa681 2 жыл бұрын
nice
@mayankjaiswal568
@mayankjaiswal568 2 жыл бұрын
Ni smjh aya
Towers of Hanoi: A Complete Recursive Visualization
21:13
Reducible
Рет қаралды 493 М.
Thank you Santa
00:13
Nadir Show
Рет қаралды 36 МЛН
СКОЛЬКО ПАЛЬЦЕВ ТУТ?
00:16
Masomka
Рет қаралды 3,5 МЛН
The Tower of Hanoi (Recursive Formula and Proof by Induction)
9:49
Florian Ludewig
Рет қаралды 42 М.
Key to the Tower of Hanoi - Numberphile
14:07
Numberphile
Рет қаралды 433 М.
Making an Algorithm Faster
30:08
NeetCodeIO
Рет қаралды 151 М.
Towers of hanoi problem
29:27
Sudhakar Atchala
Рет қаралды 22 М.
5 Simple Steps for Solving Any Recursive Problem
21:03
Reducible
Рет қаралды 1,2 МЛН
Re 5. Multiple Recursion Calls | Problems | Strivers A2Z DSA Course
16:45
Why is Python 150X slower than C?
10:45
Mehul - Codedamn
Рет қаралды 20 М.
Tower of Hanoi | Recursion
24:01
Aditya Verma
Рет қаралды 173 М.