← All problemsSign in

Collect Game

Alice and Bob are playing a game of moving coin on a N x N grid of 0s and 1s. Rows are numbered 1 to N from top to bottom and Columns are numbered 1 to N from left to right. Starting from a cell in the 1st row, they take turns alternately each time moving the coin to the next row. From a cell (i,j) they can move the coin to any of the cells (i+1,j-1), (i+1,j), (i+1,j+1) as long as it lies inside t

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