가장 긴 팰린드롬

• 가장 긴 팰린드롬 부분문자열 (Longest Palindromic Substring)을 참고. Manacher's algorithm을 이용해서 O(n)에 풀 수 있다.

"""Solution code for "Programmers 12904. 가장 긴 팰린드롬".

- Problem link: https://programmers.co.kr/learn/courses/30/lessons/12904
- Solution link: http://www.teferi.net/ps/problems/programmers/12904
"""

from teflib import string


def solution(s):
    return max(string.palindrome_radiuses('#' + '#'.join(s) + '#'))

• Dependency: teflib.string.palindrome_radiuses