Manacher's Algorithm is an efficient algorithm to find the longest palindromic substring in a given string in linear time.

**Read this article to understand the concepts behind Manacher's algorithm and explore a code example**

**Have a doubt or thought? Join the discussion now**

This is a companion discussion topic for the original entry at http://iq.opengenus.org/manachers-algorithm/