A New Implementation of Manacher's Algorithm
share
Manacher's algorithm is optimal for the longest palindromic substring problem. The implementation of this algorithm traditionally requires in-memory construction of an augmented string that is twice as long as the original string. Although the string-augmentation preprocessing has found widespread use for the implementation Manacher's algorithm, this is neither economic nor necessary. In this article, a readable implementation of Manacher's algorithm based on index mapping is developed which does away with the string augmentation.
READ FULL TEXT