BEAUTIFUL PAIR

CodeChefOpen on judge ↗

Sanchu loves beautiful pair of words. A pair of words is considered beautiful by her if they exist as two disjoint palindromic subsequences of a given word. Sanchu loves a pair most if the product of lengths of the words in the pair is maximum. Given a string, you need to find the product of lengths of the pair that Sanchu will love the most (i.e. Maximum product of length of beautiful pair

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