Question

A palindrome is a word that is spelled the same forward and backward. For example, rotor and redder are palindromes, but motor is not. Write a recursive function that takes a word (string) and check if it is palindrome or not (The function should return True if the word is palindrome otherwise it should return False). USING PYTHON

Answer 1

def is_palindrome(s):
    if len(s) <= 1:
        return True
    else:
        if s[0].lower() != s[len(s) - 1]:
            return False
        else:
            return is_palindrome(s[1:-1])


print(is_palindrome('rotor'))
print(is_palindrome('redder'))
print(is_palindrome('anna'))
print(is_palindrome('hello'))
print(is_palindrome('palindrome'))