Detección de una cadena de texto palindrómica #recursividad

PalindromeChecker.java

public class PalindromeChecker {

    public static boolean isPalindrome(String string) {
        String strippedString = string.replaceAll("\\W", ""); 
        int length = strippedString.length();

        if (length > 1) {
            return palindrome(strippedString.toLowerCase(), 0, length - 1);
        }

        return false;
    }

    private static boolean palindrome(String string, int left, int right) {
        if (left >= right) {
            return true;
        }

        char lhs = string.charAt(left);
        char rhs = string.charAt(right);

        if (lhs != rhs) {
            return false;
        }

        return palindrome(string, left + 1, right - 1);
    }

    public static void main(String[] args) {
        String testStr = "A man, a plan, a canal: Panama";
        System.out.println("¿Es palíndromo? " + isPalindrome(testStr));
    }
}