← Microsoft questions

Minimum knight moves on a grid with obstacles

Filed under Microsoft

Find the minimum number of steps for a knight to move from a start position to a target position on an N x N chessboard containing obstacle walls.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.