Solution: Valid Palindrome
Explore how to validate a palindrome string by applying the two pointer technique. Learn to skip non-alphanumeric characters, perform case-insensitive comparisons, and achieve this with O(n) time and O(1) space complexity. This lesson guides you step-by-step to build an optimal palindrome checker.
Statement
Given a string, s, return TRUE if it is a palindrome; otherwise, return FALSE.
A phrase is considered a palindrome if it reads the same backward as forward after converting all uppercase letters to lowercase and removing any characters that are not letters or numbers. Only alphanumeric characters (letters and digits) are taken into account.
Constraints:
s.length...