Minimum distance between 1s

CodeChefRating 1335Open on judge ↗

Chef has a **binary** string $S$ of size $N$. Chef can perform the following operation on the string: - Select any substring of size $3$ and **reverse** it. Find the **minimum** *distance* between **any two** $1$s Chef can achieve, by applying the above operation any (possibly zero) number of times. Note: - The *distance* between two characters $S_i$ and $S_j$ is defined as $abs(i-j)$. - It is g

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