← All problemsSign in

Reverse and Alternate

CodeChefRating 1746Open on judge ↗

A **binary** string $S$ of length $N$ is said to be *almost alternating* if it can be converted into an alternating$^\dagger$ string by performing the following operation **at most once:** - Choose two indices $L$ and $R$ ($1 \leq L \leq R \leq N$). - Then, reverse the substring of $S$ from $L$ to $R$. After this operation, $S$ will look like $S_1S_2\ldots S_{L-1}S_RS_{R-1}\ldots S_{L+1}S_LS_{R+

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