← All problemsSign in

Romantic Reversals

CodeChefRating 1646Open on judge ↗

Alice initially has a string $S$ of length $N$, and she decides to modify it! Her modification consists of $K$ steps numbered from $1$ to $K$. In the $i$-th step, Alice reverses the prefix of length $i$ of $S$. For example, suppose Alice starts with $S = \texttt{abferty}$, and she modifies it via $3$ steps, then: - After the first step, $\textcolor{blue}{\texttt{a}}\texttt{bferty} \rightarrow 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