manacher_palindrome
Find the longest palindromic substring in linear time using Manacher's algorithm, or list all palindromic substrings of length two or more.
Instructions
Find the longest palindromic substring in linear time using Manacher's algorithm.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| all | No | List all palindromic substrings of length >= 2 (default false) | |
| text | Yes | Input string |