Alice and Bob and the game of strings
CodeChefOpen on judge ↗
Alice and Bob are playing a game. They have N number of strings in the beginning of the game. Game begins with Alice and then Bob will play and then Alice and so on.. In each turn, the player (who is playing this turn) must choose any lower case english character and that character must be present in the last position of any string. Now, remove the last character from all the string which has th
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.
Sign in to chat with the tutor and save your progress.
Sign in to start