Problem Statement

This problem comes from the Runestone readings for this week. If you already completed the problem there, feel free to bring it over to the studio here.

Given a string value, determine if the string is a palindrome using a recursive function. A palindrome is a string that reads the same backwards and forwards. Define and implement a function palindrome that takes one parameter, a string, and returns True $($the boolean$)$ if the string is a palindrome and False otherwise.

Hints: Consider what should be the base case in this problem. What strings are trivially palindromes? Also consider how you could reduce the string in any given instance to move closer to the base case. Is there something about the first and last characters of a string that could immediately tell you if the string isn't a palindrome? We also strongly recommend using slicing to reduce the string for every recursive call.

Sample Input

thisisntapalindrome

Sample Output

False

Sample Input

racecar

Sample Output

True