''' longest_palindromic_substring finds the longest palindrome substring in a string
'''


def lpss(s):
    ''' lpss (Longest Palindromic SubString) returns the longest palindrome withing the string

    Args:
        s (str): string to search

    Returns:
        str: resultant substring; the first longest palindromic substring
    '''
    len_s = len(s)
    l_pal = ''
    for j in range(1, len_s+1):
        for i in range(len_s - j+1):
            ss = s[i:i+j]
            if ss == ss[::-1] and len(ss) > len(l_pal):
                l_pal = ss

    return l_pal