Question

(9) Complete the below Java method recursively, which takes in a String and returns if it's a palindrome. Remember a palindrome means a string that is the same reversed, like "deed", "racecar" or "tacocat". The empty string "" is also a palindrome. public boolean isPalindrome (String word) {

Answer 1

//(9)
//recursive method to find given word is palindrome or not
public boolean isPalindrome(String word)
{
if(word.length()==0 || word.length()==1)//if length is 0 or 1
return true;
if(word.charAt(0)!=word.charAt(word.length()-1))//if not matched
return false;
return isPalindrome(word.substring(1,word.length()-1));
  
}

Note: As per Chegg policy, I am allowed to answer only 1 question(including sub-parts)
on a single post, kingly post the remaining questions seperately and i will try to answer them
Sorry for the inconvenience caused, thank you