Map Sudoku

CodeChefOpen on judge ↗

Chef has been given a tree as an input with each node having an identifying index value along with values to certain nodes as initial value. His task is to find any valid solution by filling other nodes with numbers from 1-9 such that any number isn't in the proximity of distance 2 from another instance of itself.

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