Similiar And Minimum

CodeChefOpen on judge ↗

Given a Matrix MxN and Starting point(x,y). You Can Move in Up(i,j-1), Down(i+1, j), Right(i, j+1), and Left (i-1, j) direction to reach the final point(x,y), but the condition is you can only move on indices having similar numbers and in minimum steps. ###Example: 1. Only Move On to Similar Numbers. 2. Minimum Steps. Starting Point = (0,0) Final Point = (3,1) Min Steps = 4 (With Blue) ###Inp

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