LeetCode 5 - Longest Palindromic Subtring

[@wentaoqiu4072]

10:50 the key point of Manacher's Algorithm. Honestly, yours is the only video I have found so far that explains the fundamental idea clearly, thank you.

[@hengchunsong301]

Thank You. After studying 6+videos&articles, yours is the only one helps me understand manacher algorithm.

[@pinkhairblackman8141]

best explanation on youtube, you are the hero we dont deserve

[@manishsakariya4595]

Thank you for the dry run. it helped me understand better.

[@naturalsmen1]

This is the clearest explanation I have ever seen. Excellent work!

[@techfornoobs4241]

Best explanation I’ve found

[@AzharulIslamParvez]

Very clean explanation. Thank you!

[@yanghu2665]

Kudos! Best Manacher algo explanation.

[@jmajcan]

This was super helpful! Thankyou!

[@Vaibhav101]

Thank you so much. Struggled so much with this!

[@mohakchaudhary1981]

Excellent explanation of this problem... great ⚡⚡⚡

[@bauyrzhanmaksot3022]

Thanks, clear explanation

[@gosha5198]

It gives wrong result " bab", for s="babadada", Should give "adada"

[@ameyapatil1139]

Excellent video ( category shows comedy :) )

[@phoneix24886]

lol the difficulty of the algorithm actually makes a comedy out of any programmer who is implementing it.

[@KarthikArji]

I got IndexOutOfBound error for this code, for center =0, we are accessing lengths[2*center -i]. -->lengths[0-1]. How to avoid this error?