String Reorder

CSESIntroductory ProblemsOpen on judge ↗

Your task is to reorder the characters of a string so that no two adjacent characters are the same. What is the lexicographically minimal such string? Input The only line has a string of length n consisting of characters A–Z. Output Print the lexicographically minimal reordered string where no two adjacent characters are the same. If it is not possible to create such a string, print -1. Const

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