← Amazon questions

Minimum steps by Knight to reach destination and print path

Filed under Amazon

Find the minimum number of steps for a Knight to move from (x1, y1) to (x2, y2) on an N x N chessboard and return the path taken.

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 Amazon questions

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