write a recursive function to determine the given String is palindrome Or not and also write a recursive function to determine the length of the String?

Answer 1

This one is for determining string length

public static int stringLength(String s)
{
if (s.equals(""))
return 0;
else
return stringLength(s.substring(1)) + 1;
}

Answer 2

This one is for Palindrome
public static boolean isPal(String s)
{
if(s.length() == 0 || s.length() == 1)
// if length =0 OR 1 then it is
return true;
if(s.charAt(0) == s.charAt(s.length()-1))
// check for first and last char of String:
// if they are same then do the same thing for a substring
// with first and last char removed. and carry on this
// until you string completes or condition fails return isPal(s.substring(1, s.length()-1));
// if its not the case than string is not.
return false;
}