← All problemsSign in

Easy Navigation

Our friend Rohit is stuck in a grid and needs your help to get out of the final grid. He can go in North, South, East or West direction, but there is one problem. There is only one chance and he can go in any one of the adjacent 4 grids if the weight of that grid is equal to the weight of the current grid. Input First line of input contains T - the number of test cases. Each test case consists o

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