Validate normalized palindromes with variants

Q: Validate normalized palindromes with variants

This question evaluates string-processing skills including Unicode normalization, case-folding and diacritics handling, streaming input processing, error-tolerant palindrome logic, and analysis of time/space trade-offs.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Implement a function isNormalizedPalindrome(s) that returns true if s reads the same forward and backward after removing non‑alphanumeric characters and case‑folding. Follow‑ups: (

Support full Unicode normalization (e.g., NFKD), diacritics stripping, and locale‑specific case rules. (
Handle a streaming input where s may not fit in memory; optimize for one pass and sublinear extra space. (
Allow at most one character deletion to still count as a palindrome; generalize to up to k deletions. (
Return the index pair of the first mismatch if not a palindrome. Discuss time/space complexity, edge cases, and unit tests.

Validate normalized palindromes with variants

Overview

Comments (0)