Essays on algorithms and data structures by Ali Khalilli. Binary search, numerical methods, dynamic programming, graphs, strings. Zola 2022-06-13T00:00:00+00:00 https://invariant.khalilli.ai/tags/manacher/atom.xml 2022-06-13T00:00:00+00:00 2022-06-13T00:00:00+00:00 alikhalilli https://invariant.khalilli.ai/blog/manachers-algorithm/

<p>There are multiple different ways of implementation for this problem, like DP(lcs, etc), expanding from center. But the most optimal approach is Manacher’s Algorithm, time complexity: O(n). It’s core idea is calculating current palindrome information based on previous calculated palindrome information. Let’s draw it and see some formulas and implications.</p>