Walking Path

CodeChefOpen on judge ↗

John lives in a hilly city. He wants to go from point **A** to point **B** and he is planning to walk today. Fortunately for him, the city is designed like a grid. Unfortunately, as the elevation of each point is different, finding the easiest path is not trivial. That’s why John needs your help. John wants to find a path from **A** to **B** with minimum hardness. Hardness of going from point **A

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