longest_palindromic_substring.py

class Solution:
    def longestPalindrome(self, s: str) -> str:
        ans = ""
        highest = 0

        for i in range(len(s)):
            left, right = i, i
            while left >= 0 and right < len(s) and s[left] == s[right]:
                if right - left + 1 > highest:
                    ans = s[left:right+1]
                    highest = right - left + 1
                left -= 1
                right += 1

            left, right = i, i + 1
            while left >= 0 and right < len(s) and s[left] == s[right]:
                if right - left + 1 > highest:
                    ans = s[left:right + 1]
                    highest = right - left + 1
                left -= 1
                right += 1

        return ans