← All problemsSign in

Weird Justice

**Meena** and **Vaibhav** are suspects in a murder case and are bought in front of a judge. The judge has his way of giving justice. Whenever the case involves two suspects, he announces his verdict based on a game. He gives a binary string $S$ of length $N$ to the suspects. A binary string consists only of "1"s and "0"s. Each suspect plays in alternate turns. In every turn the player must choose

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