Concat Lexmax Substrs

CodeChefRating 3323Open on judge ↗

You are given a $1$-indexed string $S$ of length $N$ containing lowercase English letters. You also have an initially empty string $A$. Repeat the following process until $S$ is empty: - Find the [lexicographically maximal](https://en.wikipedia.org/wiki/Lexicographic_order) substring of $S$; - Let it be $S[l..r]$, where $1 \le l \le r \le |S|$ and $|S|$ denotes the current length of $S$ (if the

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