longest-almost-palindromic-substring

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given a string <code>s</code> 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 <code>s</code>.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;abca&quot;

Output: 4

Explanation:

Choose the substring <code>&quot;abca&quot;</code>.

<ul>
	<li>Remove <code>&quot;abca&quot;</code>.</li>
	<li>The string becomes <code>&quot;aba&quot;</code>, which is a palindrome.</li>
	<li>Therefore, <code>&quot;abca&quot;</code> is almost-palindromic.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;abba&quot;

Output: 4

Explanation:

Choose the substring <code>&quot;abba&quot;</code>.

<ul>
	<li>Remove <code>&quot;abba&quot;</code>.</li>
	<li>The string becomes <code>&quot;aba&quot;</code>, which is a palindrome.</li>
	<li>Therefore, <code>&quot;abba&quot;</code> is almost-palindromic.</li>
</ul>
</div>

Example 3:

<div class="example-block">
Input: s = &quot;zzabba&quot;

Output: 5

Explanation:

Choose the substring <code>&quot;zzabba&quot;</code>.

<ul>
	<li>Remove <code>&quot;zabba&quot;</code>.</li>
	<li>The string becomes <code>&quot;abba&quot;</code>, which is a palindrome.</li>
	<li>Therefore, <code>&quot;zabba&quot;</code> is almost-palindromic.</li>
</ul>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= s.length &lt;= 2500</code></li>
	<li><code>s</code> consists of only lowercase English letters.</li>
</ul>