← All problemsSign in

Broken Dreams

CodeChefRating 3084Open on judge ↗

You are given a string $S$ of length $N$, containing lowercase Latin letters. You are also given an integer $K$. You would like to create a new string $S'$ by following the following process: - First, partition $S$ into exactly $K$ non-empty [subsequences](https://en.wikipedia.org/wiki/Subsequence) $S_1, S_2, \ldots, S_K$. Note that every character of $S$ must be present in exactly one of the $S_

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

Sign in to chat with the tutor and save your progress.

Sign in to start