Chef and Grid

CodeChefOpen on judge ↗

Chef has a Rectangular Grid of size $N*M$ ( length – $N$ units and breadth M units) . There is an Ant which is initially at bottom left corner of the grid i.e. $(0,0)$ . It wants to go from bottom left corner to Top Right Corner i.e. $(N,M)$. It can take any of the Right, Left, Up, Down directions from its position. You need to print the minimal steps taken by the ant to reach the destination and

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