Write a recursive Java method that takes a String as a parameter and returns true if the String is a palindrome. You may assume that the string only contains lower case characters (i.e. no numbers, spaces, punctuation, etc).

Question

What will be an ideal response?

Answer 1

```
public boolean isPalindrome(String s) {
if(s.length() == 1)
return true;
else if(s.length() == 2 && s.charAt(0) == s.charAt(1))
return true;
else if(s.charAt(0) == s.charAt(s.length() – 1))
return isPalindrome(s.substring(1, s.length() - 1));
else
return false;

}
```