Search
⌘K
Get Premium
Leetcode 125. Valid Palindrome
Check whether a string becomes a palindrome after lowercasing and removing all non-alphanumeric characters. The typical challenge is to do this efficiently (O(n)) by scanning with two pointers that skip non-alphanumeric characters.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early September, 2025
Meta
Manager
Late July, 2025
Meta
Manager
Mid July, 2025
Meta
Staff
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.