Bi_lindrome!

CodeChefRating 1095Open on judge ↗

You are given a string $S$ of length $N$. Your task is to delete a [subsequence](https://en.wikipedia.org/wiki/Subsequence) of **maximum** length from the string, such that, after concatenating the remaining parts of the string, it becomes a [palindrome](https://en.wikipedia.org/wiki/Palindrome) of length **greater** than $1$. If this is possible, print the maximum length of the subsequence that

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