← All problemsSign in

The Game

There are two teams (Team $A$ and Team $B$) playing a tournament of $N$ matches of football against each other. Some of the matches are already completed and some are yet to be played. You are given a string $S$ of length $N$ representing the results of the $N$ matches for Team $A$. The result of the $i^{th}$ match can be represented by one of the following: - $W-$ Team $A$ won the match. A win ad

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