Kings and Queens!

CodeChefOpen on judge ↗

There is NxN chess board. But, its not your normal chess board! There are any number of kings placed in any cell of the chess board from the 2 column to the second last column. There are N queens which start from the first cell of each row. You need to calculate the shortest distance a queen will travel to reach any cell in the last column. Now, a queen will be blocked if it comes in contact

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