Palindromes

CodeChefOpen on judge ↗

You are given a string $S$. You need to arrange the string in such a manner such that resultant string has maximum number of substrings which are palindomes. In case, many such answers exist, output the one which is lexicographically smallest. Note 1: A string is called palindrome if it reads the same from the left to the right and from the right to the left. Example: "abcba", "malayalam" are

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