Minimize cost

CodeChefOpen on judge ↗

Given a string $S$. You can swap any two characters at indices $i$ and $j$ with cost $(i-j)^2$. Indices are numbered from $0$. Find the minimum cost required to convert the string $S$ into its lexicographically largest counterpart. ### Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each testcase contains of a single line of input, the string $S$. ### O

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