IEEE ROBOT

CodeChefOpen on judge ↗

You are given a 2D grid of shape $N \times N$. Some cells of this grid are blocked, others are empty. You are also given two identical robots. The robots are capable of manoeuvring the grid by moving in 4 directions. Formally, if a robot is at position $(x, y)$ in the grid, it can • Move North (N) to position $(x-1, y)$ • Move South (S) to position $(x+1, y)$ • Move East (E) to position $(x, y

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