Reference no: EM132240014

An palindrome is a word that's the same when you reverse the letters.

Examples of palindromes:

• poop
• Racecar
• Never odd or even

In this homework write a function that uses recursion to check if given word is a palindrome.

Problem Solve

Figure out how you can use recursion to solve this problem. Here are some hints:

• If a word has 1 letter, it's always a palindrome
• If a word has 2 letters, it's a palindrome if they're both the same letter
• If a word has 3 or more letters, it can only be a palindrome if the first and last letter are the same, and the letters inside those are also a palindrome

Write a function that meets these requirements

• It's named check_palindrome()
• Accept one argument, a string
• If the argument is a palindrome, return True. If it isn't, return False
• Ignore spaces in the provided argument. String.replace() might be useful here.
• Ignore case. A capital letter is the same as a lowercase letter. String.lower() or String.upper() might be useful here.
• It does not use any loops. It uses recursion instead.

Examples

Document it

Write a DocString for your function

Use inline code comments where appropriate

If you use code written by someone else, cite your sources. Indicate If this code is from the Internet, this must include a hyperlink to the webpage.