@@ -0,0 +1,540 @@
+def is_palindrome(text):%0A    return text == %22%22.join(%5Bchar for char in reversed(text)%5D)%0A%0Adef longest_palindromic(text):%0A    text_len = len(text)%0A    longest_pal_len = 0%0A    longest_pal = %22%22%0A    for i in range(len(text)):%0A        for j in reversed(range(i, text_len)):%0A            substr = text%5Bi:j + 1%5D%0A            if is_palindrome(substr):%0A                substrLen = len(substr)%0A                if substrLen %3E longest_pal_len:%0A                    longest_pal = substr%0A                    longest_pal_len = substrLen%0A    return longest_pal%0A

Create mySolution.py