Check near-palindrome with one deletion
Company: Bloomberg
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: Medium
Interview Round: Technical Screen
Given a string s, determine if it can become a palindrome after deleting at most one character. Return true or false and provide time and space complexity. Follow up: output one valid index to delete if possible.
Quick Answer: This question evaluates string manipulation and algorithmic problem-solving skills, focusing on palindromic properties and robust handling of edge cases within the Coding & Algorithms domain.