Longest Palindromic Substring O(N) Manacher's Algorithm

Problem:-
Given a string s, find out the longest palindromic substring in O(N)
using Manacher's algorithm.
This video explains the Manacher's Algorithm for finding out the longest Palindromic Substring.
Useful References:-
en.wikipedia.o...
articles.leetco...
tarokuriyama.co...
Website: www.ideserve.co.in
Facebook: / ideserve.co.in

[@ntesla5]

8 years old but still better explanation compared to newer videos explaining the same

[@IDeserve]

Thank you :)

[@AP-eh6gr]

epic explanation man. watching it twice did it for me. i can imagine the patience it took you to make these 176 slides

[@IDeserve]

+ashish paralkar Thanks a lot for your kind feedback and you are right in that it took some patience to create this video. Ashish, we would really appreciate if you can spread the word about IDeserve(www.ideserve.co.in) in your peer circles. Cheers, Team IDeserve

[@bryanbocao4906]

@@IDeserve Thanks for making these slides and video! How long did it take you to make these slides?

[@rahulchaubey8988]

Bro mai ni samajh paya

[@ritikparida3104]

GFG took 4 articles to explain this. This man nailed it in only 15 mins .

[@IDeserve]

Thanks Ritik!

[@KshitijBhatnagar]

This is really true.... :)

[@AnkitSharma-nf2gp]

23 min lie h bhai acche se dekh

[@eceserin]

Save time: I watched all of Manacher`s algorithms on youtube, this is the best one.

[@IDeserve]

Thanks Ece!

[@jony7779]

I have honestly never encountered an O(n) algorithm that is tricker than this. You give the best explanation though, thank you.

[@IDeserve]

Thank you so much for your kind words Jon!

[@Adityarm.08]

Ukkonen's suffix tree construction would do if you want to see that. 😄

[@mohammadanasmudassir9443]

@@Adityarm.08 That algorithm is an atrocity. I was only able to code 80% of it and cannot understand the online solutions :/

[@Adityarm.08]

@@mohammadanasmudassir9443 you need test cases, very thorough ones. I was also stuck at that point where you are - I think. that 1 famous Stack overflow post has a full chain of comments all of which taken together paint the full picture.

[@bittupaul9455]

Ukkonen is a nightmare

[@expansivegymnast1020]

Took me over a week to finally understand all of this. This is one of the hardest algorithms out there. Outstanding work!

[@IDeserve]

Thanks 😊

[@dazleopper99]

thank you ! Great job !@@IDeserve

[@fizzburn]

IDeserve, you definitely deserve a standing ovation! I can't wait to checkout your other videos. Thank you!

[@IDeserve]

Thanks bro!

[@shefalichaudhary8621]

I was struggling the whole day to understand this topic and now finally I saw this video. I feel relieved now , very well explained along with the code.

[@IDeserve]

Thanks a lot for your words Shefali :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@subhedarsanchay]

I don’t give up often but when I do it’s Manacher’s algorithm 😂

[@IDeserve]

🙈

[@ankitagupta8511]

+1 😒

[@DanielOchoa23]

Dude. This was hands down the BEST explanation for the algorithm I've ever heard. Thank you so much!

[@IDeserve]

Thanks Daniel!

[@ZeeshanSagheerAnsari]

Epic video on Manacher's algorithm . Very clear and precise explaination. Appreciate the effort you have put to create this content.

[@IDeserve]

Thanks Zeeshan!

[@ziyanwang6937]

Best explanation on Manacher's alg I've ever seen! Really appreciate you for sharing this!

[@IDeserve]

Thanks Ziyan!

[@kayysean99]

Quite brilliant. I went through 3-4 videos and 4-5 wiki/tutorials before this and I was extremely frustrated. Finally my friend recommended your video and it is easily the best. Thanks a ton for putting in the effort to make this video. Took me two passes to fully understand the code walkthrough but you've done a great job.

[@IDeserve]

Thank for your nice words Kayysean99!

[@tonystarc9567]

This was pretty difficult to understand but your efforts are commendable. Thank you

[@doug8171]

So far, the best video for understanding it, rather than just explaining the process

[@IDeserve]

Thank you so much Doug for your kind words :)

[@BryanRink]

I didn't think I fully got it when I finished the video, but then I tried to code it without referencing back here and it worked. Thanks!

[@imranyusubov4187]

great explanation, finally understood the enigma of Manacher's algorithm. keep doing the cool work

[@IDeserve]

Thanks Imran!

[@englishlnowledge486]

This is best lecture, I have found on KZbin to understand the Manacher's Algorithm. The way you teach It reflect how much deep understanding You have. Thank You for this wonderful explanation, It saves lot of time and effort.

[@IDeserve]

Thank You! 😊

[@jabedhasan21]

I agree with you. When I started thinking about revising this algorithm, I came here.

[@nightking6719]

best explanation found till now !!

[@shubhampareek2378]

I don't think this could've been explained any better than this. Appreciate your efforts, sir. Keep up the good work. Thanks

[@IDeserve]

Thanks Shubham!

[@tusharvyavahare9229]

I've watched around 5 videos and read 6 articles on this topic, and this video is the best and lucid explanation of the topic. Thankyou!

[@IDeserve]

Thanks Tushar! 😊

[@arnabchatterjee7651]

wow man the amount of effort you took to explain in this video is incredible, take a bow sir

[@IDeserve]

Thanks Arnab ☺️

[@KshitijBhatnagar]

Nice explanation... I watch the video a couple of times, but I understood it perfectly. Thanks man for sharing this.

[@IDeserve]

Thanks Kshitij for kind words!

[@prabhavagrawal1712]

Seriously, the best explaination I could get on whole youtube. Thanks :)

[@IDeserve]

Thanks Prabhav!

[@AbhrajyotiKundu00]

After spending 1.5 days on this problem, and reading that 4 pg GFG article, thank God I found the link of this video in the discuss section of GFG. This is the Best Explanation till now of Manacher's Algo. Thank You @IDeserve for this wonderful explanation :)

[@IDeserve]

Thanks Abhrajyoti!

[@priyanshuranjan1038]

gone through many videos of manacher's algorithm.But this is the one where my searching stopped.Thank you for this awesome content

[@IDeserve]

Thanks Priyanshu!

[@shivanshshekhar]

Was really struggling to the point I was gonna skip this algorithm. You helped me understand it, thank you so much for your help! This is way better than some videos with more views.

[@IDeserve]

Thanks for the comment Shivansh :)

[@Kp96321]

Thanks, the best walk-through of the algorithm I've seen so far!! Why'd you guys stop making videos?

[@emilianobustamante5013]

been trying to understand it for hours and I understood it perfectly in a 15 minute video. thank you so much!

[@IDeserve]

Thanks :)

[@fredesch3158]

couldn't get anything from the explanation alone, but as soon as you started showing the code, everything you explained started to click into place, very much well done

[@casinarro]

the best and most clear explanation of manacher on YT

[@IDeserve]

Thank you :)

[@aayushisingh3280]

The "thinking pause" did it for me. I am floored

[@asifmujtaba334]

I was struggling yesterday night switching from video to video, at first, I didn't understand your explanation, but now it's clear. Thank you very much.

[@IDeserve]

Thanks for your kind words :) We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@sudiptapaul9855]

Your explanation is Amazzing, simple and easy to understand, probably the best for such a complex algorithm. please keep it up. Thanks for this video and thanks to Mr Manacher as well for this algorithm.

[@IDeserve]

Thanks Sudipta!

[@madhivarman508]

went through a lot of videos to understand this algorithm. But this one is the best so far.

[@winstondu4180]

Hey, I love these videos. These are definitely helping me as I prepare for the interview for my internships.

[@IDeserve]

+Wenhao Du Thanks a lot for your words! It is very encouraging to hear such comments! Also please check out our website at: www.ideserve.co.in It has features like algorithm visualizations, learn together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@ankishbansal420]

Thanks man. I struggle for whole day to understand it, but you made it so easy. Really appreciate your effort.

[@IDeserve]

Thanks Ankish!

[@kunalpareek8321]

Excellent and very detailed presentation of a very complex topic. A lot of work must have gone into the graphics.

[@IDeserve]

Thanks Kunal!

[@prateekvats963]

Such a easy explanation, thank you sir

[@IDeserve]

Thanks Prateek!

[@chinmaiveera7586]

I've seen many top youtuber's tried to explain but only you succeeded.

[@aatishchauhan8957]

A really good explanation. Thanks for your hardwork man.

[@IDeserve]

Thanks Aatish!

[@aatishchauhan8957]

@@IDeserve Is the video on explaining the time complexity of this algorithm uploaded ?

[@kumarravi09]

Great Explanation. Probably the best i have come across so far.

[@柯宥安-q2e]

Best Manacher's Algorithm explanation I have ever seen.

[@IDeserve]

Thanks!

[@hoelefouk]

You are so good that you could have come up with this algorithm on your own. Thanks!

[@IDeserve]

Thanks Nisheet for your kind words!

[@simplysimple4890]

To those who have unliked this videos, "Are u people even humans?"

[@IDeserve]

Thank you so much for your kind words 😊

[@NishArcturus]

23:48 minutes used for the best man !! Thank you so much for this finally got this😂

[@IDeserve]

You are welcome!

[@jamesqiu6715]

I watch it again after almost 2 years, I have to say this video is by far the BEST algorithm on youtube ever!!!

[@IDeserve]

Hey James, welcome back!

[@tombrady7390]

after rewinding and pausing crying finally it just clicked dont give up on this it is staple for palindromic problems

[@puneettanwar2325]

very clear explanation. Great work. Thank you!

[@IDeserve]

Thanks Puneet!

[@m-meier]

Thank you sir! It's a really helpful video!

[@IDeserve]

Thanks Miguel! 😊

[@prashantgupta8801]

Awesome explanation. Thank you very much. Appreciate your efforts.

[@IDeserve]

Thanks Prashant!

[@glorykim9171]

This was so helpful thank you! I appreciate all of the patience it took you to iterate through this.

[@IDeserve]

Thank you so much for your kind words Glory!

[@iloveans]

Thanks for the extremely clear explanation! Tracing the code made it even better :)

[@IDeserve]

You are welcome Tyler!

[@siteshp]

What an explanation sir. Keep it up. The best thing was you dry ran the code also with values, i didn't require even a pen and a copy to understand.

[@IDeserve]

Thank you so much for your kind words Sitesh!

[@danielwen1227]

Thank you a lot for your explanation! It is the video that is worthy to spend 24 minutes on it!

[@IDeserve]

Thank you so much for your kind words Daniel!

[@rbt-0007]

Bro you saved my day with your wonderful explanation, definitely subscribing!

[@shubhamchandra9258]

Superb explanation. I was able to follow through without any trouble. Hats off. Would be great if you could explain KMP algo and Z algo as well. Thanks for this one.

[@IDeserve]

Thanks Shubham!

[@glennmarkabalos6657]

thanks man. explanation is so good!!

[@IDeserve]

Thanks Glenn!

[@akilageetha5773]

Extra ordinary explanation of the mental modal behind Manacher's algorithm. The best of the best.

[@IDeserve]

Thanks Akila!

[@BK-rs1we]

Great explanation. I feel if there were indices on P[ ] then it would be easier to follow when you went through the code.

[@AshwaniSharma-of2nq]

I have watched other videos also. But your one made me understand it completely. Kudos to you buddy. Keep going.

[@IDeserve]

Thanks Ashwani!

[@anxiousengineer]

I looked at some other explanations and yours is by far the best. Thank you so much!

[@IDeserve]

Thank you so much for your kind words Dario!

[@vijaykumarlokhande1607]

I had decided to skip manachers algo for upcoming placement! Now I have it in my toolkit! thanks man gr8 job!

[@IDeserve]

All the best for the placements!

[@savanmatariya7494]

Awesome explanation, loved your work and effort. You actually deserve it!!

[@IDeserve]

Thanks Savan!

[@sayedsohel6913]

you have done a good job debugging the code. keep it up bro.

[@IDeserve]

Thank you so much Sayed for your kind words :)

[@mihirkumarsrivastava1895]

the best explanation of manacher's algorithm, great buddy it really hepled me alot

[@IDeserve]

Thanks Mihir!

[@tanmoydatta5724]

Awesome work man. Best explanation ever i have found on online.

[@IDeserve]

Thank you so much for your kind words Tanmoy 😀

[@ganeshkumar269]

youtube recommended this, glad it did

[@IDeserve]

Thanks!

[@AnkurDwivedi75]

I have been trying to understand this algorithm, but failing .. thanks ..just a single watch here on ur channel, I have understood it completely

[@owenxu9173]

Great video. I have read some blogs about this Algorithm and still not understand. Withi your explaination, it become clear to me! Thanks very much!

[@IDeserve]

+Owen Xu Thanks a lot for your words! We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like algorithm visualizations, learn together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@gameelevator1579]

Sir you nailed it . Thank you so much for awesome explanation 🙂

[@IDeserve]

Thank you for your kind words! 😊

[@kekaiskeka]

Excellent explanation for a complex algorithm. Minor correction of logic: If condition after 'while' loop is going to run every 'i' values that are greater than R. Example: 'ABABABACDEFG' try this as an example and check C and R values would change for i > 15 and overwrite C and R values to lower values. This will result in a wrong output. So, this 'if' condition should check for P[i] should be greater than P[R] to change C and R to new values. Replace if(i + P[i] > R) with if(P[i] > P[R]) Thank you for the great explanation.

[@AshuAshuAshuAshu]

thank you so much, sir, you are great ...... I found a lot of videos on manchester's algo but all that was waste material. you are a gem in terms of algorithms.

[@IDeserve]

Thanks Ashutosh!

[@aceorochi]

Awesome! This is the most intuitive explanation, even people dull like me can understand the point of this algorithm now! Nice job, looking forward more of your publish!

[@IDeserve]

+吴佩 It's really encouraging to hear comments like these. Yes we are uploading new videos on regular basis. So, stay tuned :-). Please feel free to let us know if you would like us to upload a video for a particular topic/algorithm. We will really appreciate if you can spread the word about IDeserve(www.ideserve.co.in) in your peer circles. Thank you, Team IDeserve

[@ppantg1]

It's actually quite a simple algorithm once we become familiar with the concept. Basically, copying over the mirrors expansion length if the index lies within the current right boundary means we don't calculate the expand length from scratch at every index - we use the symmetric property of palindromes to give us a O(n) time.

[@jacobhubbard7337]

Great work. Best explanation I've seen yet.

[@IDeserve]

+Jacob Hubbard Thanks a lot for your words! It is very encouraging to hear such comments! We are striving hard to make understanding algorithms easier. Please check out our website at: www.ideserve.co.in. It has features like algorithm visualizations, learning together and many more coming soon!

[@shaivalchokshi3424]

Wonderful explanation, concise and apt :) Helped me understand it till the depth. Great work, kudos !

[@IDeserve]

Thanks Shaival for your kind words :)

[@harmeetsingh9571]

Really great explanation. Watched couple of videos for this algo and yours is the best one. Very precise and your code walkthrough was awesome which made it complete. Appreciate your efforts in making those slides. Your videos would be mine first goto from now. Happy to share!

[@IDeserve]

Thank you so much for your kind words Harmeet!

[@elvis0305]

This is awesome explanation , the visualisation helps a lot with understanding the idea behind the algorithm! Great job guys.

[@IDeserve]

Thanks Li!

[@rejetimeghavardhan7805]

Very good explanation Thanks you very much!

[@IDeserve]

Thanks Rejeti!

[@anirudhreddybasani3555]

These repetitive comments on how brilliant this video was tells us about this video...from my side I really appreciate your efforts :)

[@IDeserve]

Thanks Anirudh!

[@MadForCs16]

Best explanation On the INTERNET.

[@IDeserve]

Thanks Saurabh!

[@Sachin-tj1ci]

Superb explanation...!!!! finally understood algo..!!!

[@IDeserve]

Thanks you for your kind words Sachin!

[@prudvinathmalepati3322]

Thanks man!! You are a good teacher. I got the central idea after watching your video once. Now, I can try coding it on my own.

[@IDeserve]

Thank you so much for your kind words Prudvinath!

[@ramgopalvarma3810]

you definitely deserve a subscription man.

[@IDeserve]

Thank you so much for your kind words Ram!

[@ramgopalvarma3810]

Actually I was going to leave this algorithm after seeing Tushar Roy's video knowing how complex this is but after seeing yours the rest is history. Just make stuff like this and make KZbin a better place to learn✌️

[@IDeserve]

Thank you so much Ram!

[@samadeepsengupta]

Great Effort ... Truly Grateful sir

[@IDeserve]

Thanks Samadeep!

[@aries3690]

Absolutely amazing explanation, thank you so much!

[@IDeserve]

Thanks Aries!

[@moa7ed99]

The explanation is really good and simple. But, where is the complexity video?

[@IDeserve]

Hey Mohammed Elrashidy, If you would like to request a new video, here is the process: kzbin.info/www/bejne/aZe0fYKcqrKZopI Thanks, -Team IDeserve.

[@shabbar0333]

very clear and detail explaination.

[@IDeserve]

Thanks Shams!

[@ayushkushwaha262]

Spent whole day to understand this from other resources result ==> ~NULL Spent time here understood in 2 go !! Recommended!! Thank you for the best explanation.

[@IDeserve]

Thanks Ayush for your kind words!

[@Joyddep]

Appreciate the effort. One of the best coding channels!

[@IDeserve]

Thanks Joydeep!

[@ioboylim887]

I understood!! Thanks a lot!!!

[@IDeserve]

You are welcome!

[@jithinbabu6902]

Best explanation i came across so far

[@IDeserve]

Thank you so much for your kind words Jithin!

[@tejavemparala4377]

Great Explanation, no other video on YT does the explanation this way, I was looking for video like this. Eg: "what is making the brute force algorithm to run in O(n^2) and how it can be optimized"

[@IDeserve]

Thanks Teja!

[@rajurajesh5566]

Watched more than 10 videos before this to get this algo tns bro❤

[@IDeserve]

Thanks Raju!

[@yuvarajyuvi2644]

Good explanation man...Try to explain all the important algorithms like this...

[@forceinfinity]

Excellent presentation. Hugely helpful in understanding the algorithm

[@IDeserve]

Thanks forceinfinity for your kind words :) We are striving hard to make understanding algorithms easier. We would really appreciate if you could spread the word about IDeserve in your college and to your colleagues. Also please check out our website at: www.ideserve.co.in It has features like Algorithm Visualization, Learn Together and many more coming soon. Please check it out and leave us a comment there! Thanks, -Team IDeserve.

[@ipshamohanty6682]

Great job!!...Looking forward for more videos

[@IDeserve]

Thanks for your kind words Ipsha!

[@yevgeniygrechka6431]

This is an excellent video. Just one suggestion for future videos: in the example that you went over, we never had the case where we had to take R-i over P[mirr]. It would be good for the example to include this case.

[@adarshjadhav8877]

excellent explanation bro. your patience must be paid off. keep up good work...

[@IDeserve]

Thanks Adarsh!