← All problemsSign in

Make Length 1

CodeChefRating 1530Open on judge ↗

You are given a binary string $S$ of length $N$. You can perform the following operation on $S$: - Select an index $i \ (1 \leq i \lt |S|)$ such that $S_i=S_{i+1}$. - Set $S_i$ to $0$ and remove $S_{i+1}$ from the string. Note that after each operation, the length of $S$ decreases by $1$. Is it possible to reduce $S$ to a single character by performing the mentioned operation **exactly** $N-1$

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