Palindrome Index

  • + 0 comments

    the solution is: def ispalindromes(s): return s==s[::-1]

    def palindromeIndex(s): n=len(s) if ispalindromes(s): return -1

    for i in range(n//2):
        if s[i]!=s[n-i-1]:
            if ispalindromes(s[:1]+s[i+1:]):
                return i
            else:
                return n-i-1
    return -1