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.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"text": "<text>"
},
"name": "manacher_palindrome"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| all | No | List all palindromic substrings of length >= 2 (default false) | |
| text | Yes | Input string |