https://leetcode.com/problems/longest-palindromic-substring/description/?envType=problem-list-v2&envId=dynamic-programming&class Solution: def longestPalindrome(self, s: str) -> str: if len(s)0 Max_Len and s[i:j+1] == s[i:j+1][::-1]: # Max_Len = j - i +1 # Max_Str = s[i:j+1] # return Max_Str # Approach 2 - Expand Aroun..