Wonder Matrix

CodeChefOpen on judge ↗

Given an $NX N$ square matrix containing randomly arranged unique numbers ranging from $0$ to $N^2-1$. An effective heuristic function can be applied on this matrix to find the near-optimal steps to rearrange the numbers in row-major ascending order. At every step, only $0$ can exchange its position with one of its neighbor numbers located at left, right, top or bottom positions. The sequence of

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