Search⌘ K
AI Features

Solution: Valid Palindrome

Explore how to determine if a string is a palindrome using a two pointer approach. Learn to iterate from both ends, skip non-alphanumeric characters, handle case differences, and optimize your solution with 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:

  • 11 \leq s.length 3000 ...