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 :
- Easy : https://www.codechef.com/problems/PALIN3
- Hard : https://mirror.codeforces.com/contest/1080/problem/E
Happy coding!
I found it very useful!
Auto comment: topic has been updated by vedhant (previous revision, new revision, compare).