Corners Traversal From a Pixel

CodeChefOpen on judge ↗

NOTE: Maximum score that can be scored in this question is 44. You are provided with a grid of pixels and the task is to reach at all the four corners from a single pixel inside the grid, covering the minimum number of pixels. One is allowed to move in eight directions as is shown in Fig. 1, if a connection is available. Write an algorithm to generate all the four paths. Fig.1 - The allowed fo

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