5. Longest Palindromic Substring - LeetCode Solution

class Solution:
    def longestPalindrome(self, s: str) -> str:

        m = ""
        for i in range(len(s)):
            if len(s) - i < len(m):
                break
            for j in range( i , len(s) , 1):

                if s[i:j+1] == s[i:j+1][::-1]:
                    if len(m) < len(s[i : j+1]):
                        m = s[i:j+1]
                        
        return m