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

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.

Happy coding!

1 Like

Practice problems :