Beautiful Strings

CodeChefRating 1473Open on judge ↗

You are given a string $S$ of length $N$. A **non-empty** string $Y$ is considered *beautiful* if it satisfies both of the given conditions: - Let $f(c, X)$ denote the frequency of character $c$ in string $X$. For every character $c$ present in string $Y$, $f(c,Y) \le f(c,S)$. - String $Y$ should be **lexicographically smallest** among all possible strings obtained by rearranging the characte

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