Write a function that finds the longest palindromic substring of a given string. Try to be as efficient as possible!
If you find more than one substring, you should return the one that’s closer to the beginning.
Input: A text as a string.
Output: The longest palindromic substring.
longest_palindromic('abc') == 'a' longest_palindromic('abacada') == 'aba'
1 < |text| ≤ 20
The text contains only ASCII characters.
- No Ads
- No Limits
- More Content
CheckiO Extensions allow you to use local files to solve missions. More info in a blog post.
In order to install CheckiO client you'll need installed Python (version at least 3.8)
Install CheckiO Client first:
pip3 install checkio_client
Configure your tool
checkio --domain=py config --key=
Sync solutions into your local folder
(in beta testing) Launch local server so your browser can use it and sync solution between local file end extension on the fly. (doesn't work for safari)
checkio serv -d
Alternatevly, you can install Chrome extension or FF addon
checkio install-plugin --ff
checkio install-plugin --chromium