<garvit244>05_1.py
def longestPalindrome( s):
    dp = [[0 for _ in range(len(s))] for _ in range(len(s))]
    maxLength, result = 1, ""
    for index in range(len(s)):
        dp[index][index] = 1
        result = s[index]
    
    length = 2
    
    while length <= len(s):
        index_i = 0
        while index_i < len(s) - length + 1:
            index_j = index_i + length -1
    
            if length == 2 and s[index_i] == s[index_j]:
                dp[index_i][index_j] = 1
                maxLength = max(maxLength, 2)
                result = s[index_i:index_j+1]
            elif s[index_i] == s[index_j] and dp[index_i+1][index_j-1]:
                dp[index_i][index_j] = 1
                if length > maxLength:
                    maxLength = length
                    result = s[index_i:index_j+1]
    
            index_i += 1
        length += 1
    
    return result
def sample_funcname ( var_0 ) :
    var_5 = [ [ 0 for var_2 in range ( len ( var_0 ) ) ] for var_2 in range ( len ( var_0 ) ) ]
    var_7 , var_9 = 1 , ""
    for var_10 in range ( len ( var_0 ) ) :
        var_5 [ var_10 ] [ var_10 ] = 1
        var_9 = var_0 [ var_10 ]
    var_12 = 2
    while var_12 <= len ( var_0 ) :
        var_13 = 0
        while var_13 < len ( var_0 ) - var_12 + 1 :
            var_14 = var_13 + var_12 - 1
            if var_12 == 2 and var_0 [ var_13 ] == var_0 [ var_14 ] :
                var_5 [ var_13 ] [ var_14 ] = 1
                var_7 = max ( var_7 , 2 )
                var_9 = var_0 [ var_13 : var_14 + 1 ]
            elif var_0 [ var_13 ] == var_0 [ var_14 ] and var_5 [ var_13 + 1 ] [ var_14 - 1 ] :
                var_5 [ var_13 ] [ var_14 ] = 1
                if var_12 > var_7 :
                    var_7 = var_12
                    var_9 = var_0 [ var_13 : var_14 + 1 ]
            var_13 += 1
        var_12 += 1
    return var_9
