Chef Loves 1010

CodeChefRating 1335Open on judge ↗

Chef is given a binary string $S$ of length $N$. As Chef loves $1010$ and he is busy in the preparation of Christmas, he asks you to count the **maximum** number of continuous substrings $1010$, which Chef can get after reordering symbols in the given string. As a reminder, a binary string is a string consisting only of $0$'s ans $1$'s. ### Input - The first line of the input contains a single i

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