**Question:** Implement a method that checks whether a string is a palindrome or not.

Related Tags:

The easiest way to solve this problem is to break the String into a char array, then comparing the chars from two ends. This algorithm runs in O(n) time.

```
public static boolean isPalindrome(String input) {
// Break into a char array
char[] charArray = input.toCharArray();
// Compare front and end character until meet at middle
for (int i = 0, j = charArray.length-1; i < charArray.length / 2; i++, j--) {
if (charArray[i] != charArray[j])
return false;
}
return true;
}
```

Came up with a better solution or have a question? Comment below!

Next Challenge: Project Euler Problem 12: Highly divisible triangular number