← All problemsSign in

Game Theory

Tarun and Varun are learning game theory. Today they came up with a new game. The rules are as follows: - Initially they have a string consisting of lowercase english alphabets only. - Each of them take turn. - In each turn, a player removes some alphabets from the string (at least one). But the condition is all the alphabets removed must be same (see explanation of the test cases). - The pl

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