comefrom: <doocs>0005.Longest Palindromic Substring_1.py
code: def longestPalindrome( s: str) -> str:
      n = len(s)
      dp = [[False] * n for _ in range(n)]
      start, mx = 0, 1
      for j in range(n):
          for i in range(j + 1):
              if j - i < 2:
                  dp[i][j] = s[i] == s[j]
              else:
                  dp[i][j] = dp[i + 1][j - 1] and s[i] == s[j]
              if dp[i][j] and mx < j - i + 1:
                  start, mx = i, j - i + 1
      return s[start : start + mx]
masked: def sample_funcname ( var_0 : str ) -> str :
      var_3 = len ( var_0 )
      var_7 = [ [ False ] * var_3 for var_5 in range ( var_3 ) ]
      var_9 , var_11 = 0 , 1
      for var_12 in range ( var_3 ) :
          for var_13 in range ( var_12 + 1 ) :
              if var_12 - var_13 < 2 :
                  var_7 [ var_13 ] [ var_12 ] = var_0 [ var_13 ] == var_0 [ var_12 ]
              else :
                  var_7 [ var_13 ] [ var_12 ] = var_7 [ var_13 + 1 ] [ var_12 - 1 ] and var_0 [ var_13 ] == var_0 [ var_12 ]
              if var_7 [ var_13 ] [ var_12 ] and var_11 < var_12 - var_13 + 1 :
                  var_9 , var_11 = var_13 , var_12 - var_13 + 1
      return var_0 [ var_9 : var_9 + var_11 ]
  