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.↵
↵
- [video link](https://youtu.be/YVZttWzvyw8)↵
↵
Practice problems :↵
— Easy — https://www.codechef.com/problems/PALIN3↵
— Hard — https://mirror.codeforces.com/contest/1080/problem/E↵
↵
Happy coding!
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.↵
↵
- [video link](https://youtu.be/YVZttWzvyw8)↵
↵
Practice problems :↵
— Easy — https://www.codechef.com/problems/PALIN3↵
— Hard — https://mirror.codeforces.com/contest/1080/problem/E↵
↵
Happy coding!
