Longest Palindromic Substring — Manacher's Algorithm (Video tutorial)

Revision en3, by vedhant, 2020-03-29 09:47:37

Hi, Manacher's algorithm is used to find the longest palindromic substring in linear time. Its a fairly complex algorithm and understanding its time complexity is the hardest part. So, I have made a video on Manacher's algorithm to help you understand it to the fullest.

Practice problems :

Happy coding!

Tags manacher algo, #tutorial


  Rev. Lang. By When Δ Comment
en3 English vedhant 2020-03-29 09:47:37 36 Tiny change: 'oblems :\n- Easy :' -> 'oblems :\n\n- Easy :'
en2 English vedhant 2020-03-29 09:44:50 158
en1 English vedhant 2020-03-27 16:09:58 405 Initial revision (published)