April 30d Coding Challenge > Knight’s Tour
Day 8 - Knight’s Tour
Given a NxN chessboard, plot the path a Knight can take starting from any spot on the board, and visit each square exactly once.
One such example shown in the image below for a 5x5 board.
Note: The knight can start from any square. Some of the solutions are “closed loop” as in, the square you start from can be reached from the square you end with. This may result in duplicate solutions.
To Discuss more and follow up, join us at SDE Skills Discord Server, use the #women-in-tech channel.
How to submit your code
- Head over to repl.it
- create an account / log in.
- Code your submission and share it with user @sdeskills
- e-mail your submission to [email protected]
Note: While there is no submission deadline per-se, we recommend you answer these questions as soon as they are posted.
