CodingMediumcod-g1369

Subject StringsLevel Entry–Mid~15 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

Given a string s of lowercase letters, decide whether it can be turned into a palindrome by deleting at most one character. Return True if it can, False otherwise. For example, 'abca' is true: deleting 'b' or 'c' leaves a palindrome. The empty string and single characters already count as palindromes.

Implement

almost_palindrome(s: str) → bool

Examples

in["abca"]outtrue

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.