Max Palindrome

CodeChefOpen on judge ↗

You will be given a string of lowercase English alphabet letters. You have to find two palindrome which are non-overlapping subsequences such that the product of their lengths is maximised. (Subsequence: It is a string derived from deleting some elements without altering order. AC is a subsequence of ABCD; BA is not.) Let's say P and Q be two subsequences. Pi and Pj are the indices of first and

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