public class Solution {
    public boolean isPalindrome(String text) {

        if (text.length() == 0 || text.length()== 1){
            return true;
        }


        String normalizedText = text.toLowerCase();

        StringBuilder reversedText = new StringBuilder();

        for (int i = text.length() - 1 ; i >= 0 ;i--){
            reversedText.append(normalizedText.toCharArray()[i]);
        }
        
        return reversedText.toString().equals(normalizedText);
    }
}