Emordnilap Str

CodeChefOpen on judge ↗

After a successful contest, the Executives of SCOE Pune CodeChef Chapter decided to play a string game. In that, You have $n$ *$distinct$* strings of equal length $m$. You are asked to discard some of the strings (possibly none or all) and reorder the remaining strings so that the concatenation ($+$) of those becomes a palindrome. *Also the palindrome has to be as long as possible.* *Not

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