Solution: Valid Palindrome
Understand how to determine if a string is a valid palindrome by using two pointers moving inward. Explore skipping non-alphanumeric characters, performing case-insensitive comparisons, and achieving an O(n) time and O(1) space complexity.
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...