Manacher's Algorithm

[asmit27rai]

Issue: Implement Manacher's Algorithm

Description

Manacher's algorithm is used to find the longest palindromic substring in a given string in linear time. It is an optimized version of the naive approach and is widely used in string processing tasks. This algorithm is particularly useful in problems where you need to find the longest palindrome in a string, such as in text analysis and computational biology.

Proposed Implementation

The implementation should include:

1. A function manacher(text: str) -> str that returns the longest palindromic substring in the input string text.
2. Proper documentation and examples demonstrating the usage of the function.

[asmit27rai]

@Kishan-Ved I am working on this issue..