Manacher's Algorithm | Code Tutorial and Explanation

Free-To-Use Developer ToolBox: developertoolb...
How to Micro SaaS side-hustle: quinston.com/m...
The Code can be found at:
quinston.com/c...
github.com/gra...
❌ Do not click this link: bit.ly/dont-eve...
I do not claim to own any of the code explained in the video unless I explicitly mention that I own the code. It is usually inspired by various websites and I have tried to make some of my own changes for the sake of this tutorial.
Send me an email or comment below if you want to be credited.

[@DemonSlayer13375]

The explanation was great, but I found the background kind of distracting. I think it'd be easier to focus on the algorithm without all of the background noise

[@tuhinmukherjee8141]

Honestly, I wouldn't recommend this to anyone.

[@harikiranvusirikala]

I liked ur video, but better explain the code along with taking an example simultaneously, Thank for code.

[@quinston]

YO! Feedback taken! Thanks!

[@abhijeetshuklaoist]

Till 4 minutes mark, this video was good but I could not understand anything after that and that exactly is the crux of Manacher's algorithm.

[@joshuashevitz2962]

I think I got lost. When the pointer was at the hash on the right of b (I = 3) I don't understanding picking between the center or R-pointer

[@MRaj-xz5kq]

Great video but the background distracts a bit. So try to keep it as simple as possible.

[@TheAceInfinity]

The background video is super distracting from the main material.

[@jianingzhuang104]

Best video I can find for Manacher's Algorithm!

[@samiahmadkhan2865]

worst explanation ever. Made me more confused than ever

[@peixinlin9670]

I watched couples of videos about Manacher' algorithm and this is the best one for me!

[@АсылжанНурлыбекулы-ч1ш]

Good explanation, but weak example.

[@flyingtiger123]

In the expansion part, i guess you miss a condition that the i-1-p[i] or i+1+p[i] may run out of bound

[@jeremybrocast]

thank you!

[@mathguy198]

Thanks man for such a nice and easy explanation to such a complex algorithm.

[@vishalagrawal7651]

absolutely amazing video,plzz keep making these videos

[@partheshsoni6421]

Wow man, how can such a nice tutorial and channel went unnnoticed on YT!!

[@SuperMaDBrothers]

The background gave me a seizure

[@maneeshreddy3825]

Best explanation of manacher's algorithm on youtube

[@manishkumar-cu3sb]

Nicely explained...I did not get what is the use of min(R-i,p[i_mirror] you should have taken p[i]=p[i_mirror] then also it will get same result ??

[@chunxinchu2037]

line 91 of your code: while (str[i + 1 + P[i]] == str[i - 1 - P[i]]){
P[i]++;
}
why do you need to check if (I==R)? Which means you only need to expand when you reach the R boundary of the palindrom? Thanks

[@andaouyang135]

For the while loop in line 91: while (str[i+1+P[i]] == str[i-1-P[i]])), the index of string may be negtive. For example, when i = 0, P[i] = 0, then i-1-P[i] = -1 < 0. So I think such a line should be replaced by: while (i-1-p[i] >= 0 && i + 1 + p[i] < length && T[i + 1 + p[i]] == T[i-1-p[i]])?

[@MrMaxKey]

good demo, but unfortunately no explanation why it works

[@Darkmatterkun]

This was a really clear and concise algorithm! Really appreciate your work.

[@btSehajbirSingh]

The best and easiest video you can get for Manacher's Algorithm!! Keep up the positivity in ur videos....

[@dragosc8202]

Thank you so much, finally understood it!

[@chinmayapanigrahi7642]

Your explanation is mind blowing and i appreciate that.
But your implementation fails for input - "bb" .

[@hritikhanda630]

you can simply solve that by applying a more condition
if(c>=r||a.charAt(c)==a.charAt(c-2)) //Duplicate entries
{
expand and assign l, r, mirror;
}

[@ahusain1462]

Like he said, Manacher's Algorithm is not easy to understand. But this is a very good explanation. Thanks for this.

[@lipimaheshbhaishah9548]

I really appreciate your work and found one of the best videos about Manacher's algorithm. One request if you also can provide the same code in java as well, it will be really appreciated. Thank you.

[@simeonarabov6379]

Could you please help me aquire the set of Preffix and Suffix Palindromes. That is all palindromes starting at i = 1 or ending at i = s.length().

[@go_cool_travels]

While watching for the first time!! Wow that background graphics looking awesome.
#amIonlyOne

[@adithyabhat4770]

incredible incredible lol

[@xayah3375]

Well explained video, thx.XD

[@nishanktripathi6589]

This is the best explanation I found 🙏

[@shikharchaudhary6984]

Good work.

[@chunxinchu2037]

Fantastic! This is the best explanation which is easiest to understand so far!

[@mastrake]

Great explanation! I do see a minor problem at line 91 where on iteration 0, the expression "i - 1 - P[i] results in an index of -1.

[@quinston]

Does it give you an error?

[@mastrake]

It works for me but can fail depending on what value happens to be at the address of str minus 1 in storage.

[@KarthikArji]

@@quinston yeah i got an error. Please tell me the solution for it

[@rasmiranjanbabu]

Liked the code walk through

[@zhuzhuqing4862]

amazing!

[@honeybunnysugarpie]

I understood thanks to you

[@cagmz]

Nice work

[@scotl33t]

Well done mate!

[@grijeshmnit]

Get a down vote me! Better luck next time. Thanks

[@vishalagrawal7651]

amazingly explained

[@quinston]

Thanks. :)

[@mrblacksanta]

Damn , never expected someone to explain Manacher's algorithm this bad.

[@harshagrawal3620]

very well explained, nice job dude!!!!

[@karamveersingh9929]

I don't know why this video has so many dislikes, but probably the best video that explain this algo. thanks Bro

[@mirela9974]

I really understood the alrogithm. Great! Keep up the great work

[@kaustubhparmar4274]

Really great explanation,finally one -simple and clear.