X285: Recursion Programming Exercise: Check Palindrome

Write a recursive function named 'checkPalindrome' that takes a string as input and returns true if the string is a palindrome and false if it is not a palindrome. A string is a palindrome if it reads the same forwards or backwards.

Examples:

checkPalindrome("madam") -> true
Reset

Practice a different Java exercise