← All problemsSign in

Suspense String

CodeChefRating 1500Open on judge ↗

Alice and Bob are playing a game with a binary string $S$ of length $N$ and an empty string $T$. They both take turns and Alice plays first. - In Alice's turn, she picks the **first** character of string $S$, appends the character to either the **front** or **back** of string $T$ and deletes the chosen character from string $S$. - In Bob's turn, he picks the **last** character of string $S$, ap

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