Problem
Ask
Submissions

Problem: Valid Palindrome

Medium
30 min
Explore how to use the two pointers technique to efficiently check if a given string is a valid palindrome. Learn to handle alphanumeric filtering and case normalization to solve this common coding interview problem.

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\leq 3000

  • s consists only of printable ASCII characters.

Problem
Ask
Submissions

Problem: Valid Palindrome

Medium
30 min
Explore how to use the two pointers technique to efficiently check if a given string is a valid palindrome. Learn to handle alphanumeric filtering and case normalization to solve this common coding interview problem.

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\leq 3000

  • s consists only of printable ASCII characters.