Check near-palindrome with one deletion
Overview
This question evaluates proficiency in string algorithms and the two-pointer technique, along with attention to edge cases such as Unicode normalization and case-insensitive comparisons.
Meta
Aug 7, 2025, 12:00 AM
Software Engineer
Technical Screen
Coding & Algorithms
0
0
Given a string s, determine whether it can become a palindrome after deleting at most one character. Return both the boolean result and one valid index to delete if possible. Provide an O(n) two-pointer solution and discuss how you would handle Unicode or case-insensitive comparisons.