Without knowing the language, it's pretty imposible to write it. Once you start thinking recursively, it's not a difficult problem.
While you're recursing, pass the string without the first character.
The base case would be a null string which would return 0.
The unwind would just add one and return that.
Answer:
What are you trying to say?
Explanation:
Answer:
(s.charAt(0) != s.charAt(s.length()-1))
Explanation:
public class Palindrome
{
public static void main(String[] args) {
System.out.println(isPalindrome("car"));
System.out.println(isPalindrome("carac"));
}
public static boolean isPalindrome(String s) {
if (s.length() <= 1)
return true;
else if (s.charAt(0) != s.charAt(s.length()-1))
return false;
else
return isPalindrome(s.substring(1, s.length() - 1));
}
}
You may see the whole code above with two test scenarios.
The part that needs to be filled is the base case that if the character at position 0 is not equal to the character at the last position in the string, that means the string is not a palindrome. (If this condition meets, it checks for the second and the one before the last position, and keeps checking)
Ooh, ooh, ooh I know this one!
One advantage is that you don't have to make the entire layout of what you are doing from scratch. It is also time saving by not making you write everything.
