dsa · easy

Valid Palindrome

GreyOrangeStringTwo PointersFoundation

A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Given a string s, return true if it is a palindrome, or false otherwise.

Arguments

• s — the input string (or list of characters, if reversing in place)

**Example 1:** `` Input: s = "A man, a plan, a canal: Panama" Output: true ``

Constraints

1 <= s.length <= 2 * 10^5 Hidden tests include near-max size for this bound; a slower-than-intended solution TLEs.

Examples

Example 1

Input:
A man, a plan, a canal: Panama

Expected:
true

Example 2

Input:
race a car

Expected:
false

Open in the Dojo editor