← All problemsSign in

Bored Games

Alice and Bob ran out of games one day and came up with a simple game with strings. Given some string, both of them select a character(a - z)(both cannot choose the same character), whoever chose the character with the higher frequency in the string would win, if both characters had the same frequency the game would be a draw, both Alice and Bob play optimally and Bob goes first. However Bob got b

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