3844. Longest Almost-Palindromic Substring

LeetCodeTwo PointersStringDynamic ProgrammingOpen on judge ↗

You are given a string s consisting of lowercase English letters. A substring is almost-palindromic if it becomes a palindrome after removing exactly one character from it. Return an integer denoting the length of the longest almost-palindromic substring in s. Example 1: Input: s = "abca" Output: 4 Explanation: Choose the substring "abca". - Remove "abca". - The string becomes "aba", wh

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI