Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Nice clear solution solution in Clear category for The Longest Palindromic by bsquare
def longest_palindromic(line):
for length in range(len(line), -1, -1):
for start in range(len(line) - length + 1):
sub = line[start:start+length]
if sub == sub[::-1]:
return sub
return ''
if __name__ == '__main__':
assert longest_palindromic('abc') == 'a'
assert longest_palindromic('abacada') == 'aba'
assert longest_palindromic('artrartrt') == 'rtrartr'
assert longest_palindromic('aaaaa') == 'aaaaa'
print("Coding complete? Click 'Check' to earn cool rewards!")
Aug. 30, 2019
Comments:
