← All problemsSign in

Game - 01

Alice and bob are going to play a game. There are $N$ cities.Alice from left and bob from right start capturing the cities . If they want to capture a city , they need to stay $a[i]$ seconds in that city. If alice capture a city first then bob can't capture that city and vice versa . Who capture the more number of city is the winner of the game. You want to find who will be the winner of the game

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