-- coding:utf-8 -- class Solution: def getLongestPalindrome(self, A, n): # write code here if n <= 1: return n sub_len = n while sub_len > 1: for i in range(n - sub_len +1): sub_a = A[i:i + sub_len] if A[i] == A...