โ† Amazon questions

Knight Walk Problem

Filed under Amazon

Given an N*N chessboard, find a sequence of moves that allows a knight to visit every square on the board exactly once (Knight's Tour problem).

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.