Palindrome Check
easySave
StringTwo Pointers
Given a string, write a function to check if it is a palindrome. Consider only alphanumeric characters and ignore cases.
Example 1
Input
[ "A man, a plan, a canal: Panama" ]
Output
true
Explanation. After removing non-alphanumeric characters and converting all to lower case, 'amanaplanacanalpanama' is a palindrome.
Example 2
Input
[ "race a car" ]
Output
false
Explanation. After processing, 'raceacar' is not a palindrome.
Example 3
Input
[ "" ]
Output
true
Explanation. An empty string is considered a palindrome.
Example 4
Input
[ " " ]
Output
true
Explanation. A single space, when cleaned of non-alphanumeric characters, leaves an empty string which is a palindrome.
Follow-up: Can you solve the problem in O(n) time and O(1) space complexity? What changes would you make to handle Unicode characters?
Constraints:
The input string may contain non-alphanumeric characters and may be empty.
- Views
- 4