Leetcode 2664. The Knight’s Tour

Find a sequence of knight moves that visits every square of an N×N chessboard exactly once (a Hamiltonian path/cycle in the knight-move graph), typically from a given starting square. The problem requires search/backtracking with pruning or heuristics (e.g., Warnsdorff’s rule) to construct a valid tour or report none exists.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2664. The Knight’s Tour

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact