Chef and his Friend

CodeChefOpen on judge ↗

Given a 2D grid of size $N$*$M$ ($N$ rows and $M$ columns) . Chef and his friend Max are initially on the grid at the positions ($X1$,$Y1$) & ($X2$,$Y2$) respectively. They wanted to reach ($N$, $M$) to eat Ramen. They decided that the last to Reach ($N$, $M$) will give treat to the other. To reach their destination faster they are allowed to use teleportation doors present on the grid at some l

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