Loading...
Valid Palindrome
#008
easy
string
algorithm
easy
Description
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.
Example:
-
Input:
s = "A man, a plan, a canal: Panama" -
Output:
true(because "amanaplanacanalpanama" is a palindrome) -
Input:
s = "race a car" -
Output:
false
Instructions
- Convert to lowercase and remove non-alphanumeric characters
- Use two pointers to compare from both ends
- Return true if all characters match, false otherwise