## Piinky 4 years ago help on attachment

1. Piinky

2. Piinky

question 2 (a)

3. Narsat

I would go for the easy way; trim all spaces on the string, and compare first place of the string to the last, make sure they're equal. then second to last-1, third to last-2, ... until you get to length/2. Return true if you get to length/2. false if at any point they are different. Example: able was i ere i saw elba -trim- ablewasiereisawelba compare: a = a? yes compare b = b? yes compare l = l? yes etc.

4. Narsat

Apparently, I can't read, it's recursive. but same thing applies. public boolean testPalindrome(String palindrome){ if(palindrome.length() <= 1) return true; if(palindrome.chatAt(0) == palindrome.charAt(palindrome.length()-1) return testPalindrome(palindrome.substring(1, palindrome.length-1); else return false; } Code in Java, but it should be easy to adapt. You should do the comparison, and send to the recursive function the String minus the first and last places, then go at it again. Test for length, return true if you've reached 1 or 0 (if length was odd or even numbered), and return false if at any point they differ.