Given a string s, find the length of the longest almost palindromic substring in s.

A string is defined as almost palindromic if it can be transformed into a palindrome by deleting at most $1$ character from it.

A substring is a contiguous non empty sequence of characters within a string.

Constraints:

• $2 \leq$ s.length $\leq 2500$

• s consists of only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.