125. Valid Palindrome | LeetCode | Top Interview 150 | Coding Questions

Source: Dev.to

Problem

• LeetCode – Valid Palindrome
• Solution discussion (most optimal approach, beats 100%)

Solution

class Solution {
    public boolean isPalindrome(String s) {
        s = s.toLowerCase();
        int left = 0;
        int right = s.length() - 1;

        while (left = 'a' && chLeft = '0' && chLeft = 'a' && chRight = '0' && chRight <= '9')) {
                right--;
                continue;
            }

            // Compare the current characters
            if (chLeft != chRight) {
                return false;
            }

            left++;
            right--;
        }

        return true;
    }
}