Tap here to switch tabs
Problem
Submissions

Problem: Valid Palindrome

Valid Palindrome asks you to return true if a string reads the same backward after keeping only letters and digits and treating uppercase and lowercase letters alike.

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:

  • 1≤1 \leq s.length ≤3000\leq 3000

  • s consists only of printable ASCII characters.

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Valid Palindrome

Valid Palindrome asks you to return true if a string reads the same backward after keeping only letters and digits and treating uppercase and lowercase letters alike.

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:

  • 1≤1 \leq s.length ≤3000\leq 3000

  • s consists only of printable ASCII characters.