Hello guys, I am searching for some OJ problems which is solvable using Manacher's algorithm. So far I have found some problems like 1 . problem 1 2 . problem 2 3. problem 3 4. problem 4 I will be thankful to you if u provide me some more problems on this algorithm that u know. Thanks in Advance:).
https://codeforces.com/contest/1080/problem/E
Thanks a lot man :).
https://csacademy.com/contest/archive/task/palindromic-friendship
https://www.codechef.com/problems/PALIN3
https://leetcode.com/problems/longest-palindromic-substring
Thank you :)
https://www.spoj.com/problems/EPALIN/
This is a very simply formulated but tough problem, where Manacher's algorithm is the first (easy) half of the problem:
https://open.kattis.com/problems/palindromes
But it is good for practicing your palindrome thinking. It took me two weeks to come up with a solution a couple of years ago :)
New problem: https://codeforces.com/contest/1326/problem/D2