Adjacent Flips
You are given a *binary* string $S$ of length $N$. You can perform the following operation on it: - Choose an index $i$ ($1 \leq i \lt N$) such that $S_i = S_{i+1}$, and flip both $S_i$ and $S_{i+1}$. Flipping $S_i$ means it becomes $1$ if it was originally $0$, and vice versa. For example, if $S = \texttt{0101100}$, performing the operation with $i = 4$ would result in $S = \texttt{010\underl
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.
Sign in to chat with the tutor and save your progress.
Sign in to start