Search
⌘K

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:

Apple

Meta


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Mid February, 2026

Meta

Mid-level

Late January, 2026

Apple

Mid-level

Late January, 2026

Meta

Mid-level

Comments

Your account is free and you can post anonymously if you choose.