Problem
Ask
Submissions

Problem: Valid Palindrome

Medium
30 min
Understand how to identify valid palindromes by ignoring case and non-alphanumeric characters. Learn to efficiently apply the two pointers technique to solve palindrome checks, exploring problem constraints and implementing solutions in code.

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
Understand how to identify valid palindromes by ignoring case and non-alphanumeric characters. Learn to efficiently apply the two pointers technique to solve palindrome checks, exploring problem constraints and implementing solutions in code.

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.