Binary Smile

CodeChefRating 1257Open on judge ↗

Chef has two binary strings $A$ and $B$, each of length $N$. In one operation, Chef can choose any substring of $A$ that contains **at most one** '$1$', and reverse it. Determine the minimum number of operations required to convert $A$ into $B$. If it is impossible, print $-1$. **Note:** A substring of $A$ is a contiguous sequence of characters within $A$. ### Input - The first line contains a

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