Check near-palindrome with one deletion

Q: Check near-palindrome with one deletion

This is a Coding & Algorithms interview question from Bloomberg for Software Engineer roles. View the full question and solution on PracHub.

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

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.

Check near-palindrome with one deletion

Comments (0)