Tower Of Hanoi Hello World Recursion & Dynamic Programming Playlist by prince in Hindi

[@bollywoods9]

Bhaiya bahut din se question solve karne ki try kr rha tha but kuch samjh hi hi aaya lekin aaj aapki ye video dekh kr pura samjh aagya mujhe thankyou so much bhaiya really

[@prathameshlakhpati9970]

Superb. Just broken it down seamlessly. Finally understood it. I knew the code but lacking the intuitio. Once again thanks

[@HelloWorldbyprince]

Great to hear!

[@AtharvGupta098]

I was strugging with this problem from something like an hour and u made it all cllear in just some minutes thankyou so much!!

[@ishanithakur4907]

Finally someone made this code so much understandable

[@pramodaswani9100]

bhaiya sach me kaafi achhe se samajh aaya thank you so much

[@MalobikaNandy]

Understood completely. Thank you!

[@PrinceSingh-rs4ed]

Samajh me aa gya, ekdam achhe se

[@HelloWorldbyprince]

Wahhh great yaar

[@manishrohila4033]

just watching your graph series

[@anmolchaurasia9401]

superb! mind blowing!

[@HelloWorldbyprince]

Thanks a lot 🥰

[@yashbahuguna8135]

great explaination sir

[@sudhadevi6692]

Sach me smj aa gya bhaiya ❤

[@HelloWorldbyprince]

Thanks a lot

[@it37shubhamdubey55]

Pls solve more better problems of recursion😊

[@pranavhendre6209]

thank you bhaiya

[@shingareom]

Done, thanks ❤️.

[@kuldeepchouhan8467]

well explained!!

[@sdmovies5430]

Awesome bhaiya love it

[@HelloWorldbyprince]

Thanks pls share this video in your college and friends

[@iRafi077]

cool!!!

[@Ykj21]

Awesome 😎😎😎😎❤❤❤❤

[@khushiramginnare4961]

Hey bro, Thanks for explanation..

[@HelloWorldbyprince]

Always welcome

[@himanshusahu6879]

nice

[@HelloWorldbyprince]

Thanks

[@Shoaib-d1d]

haa. bhai samaj mein to aya

[@HelloWorldbyprince]

Thanks

[@EnjoyLife-wk6bj]

If n=3 then n-1=2 then n=2 should be taken to aux tower then how n=1 was taken to aux tower first.

[@shivamtiwari8106]

Nice lecture

[@HelloWorldbyprince]

Thanks for liking

[@Lelkanta]

Great Vid! #princebhai

[@lavish1673]

I understood the logic and thought the code for this must be very long , but after Seeing the actual code its was like :- WHAT WAS THATT

[@HelloWorldbyprince]

😁 keep Learning like this

[@rahulsh5464]

bro..ye smjh ni aaya rules m tha ki ek-2 disc uthaenge...aapne toh first step m hi n-1 disc uthake auxiliary m rkhdi...

[@ashutoshkumarsingh2137]

bhaiya tower of hanoi me rod kitane hote hai?

[@vaibhavkesar7810]

bhaiya vdo bhot acaha th pr iska recurseion tree k dry run steps bnane m dikkat hora h

[@MillionaireBull]

🙌🙌🙌🙌

[@HelloWorldbyprince]

Thanks yaar ❤️ please share my channel

[@chillmood7906]

bhaiyaa count kese kiya ?? mujhe vo ni aya bas sab aagya uske alawa

[@deidara9352]

can N ==0 can be a base condition ?

[@AmanSharma-lu6rg]

check the constraints.

[@salonirom4776]

Data structure samajh me ni aata 😔

[@HimanshuKumar-qg2cp]

bhaiya oops bhi padha do samaj nahi aa rahe hai

[@HelloWorldbyprince]

sure i will teach