LeetCode
Question
·
Dec 2015
Microsoft - Knight's tour problem
15 upvotes
21,482 views
10 replies
Question Details
Given an mxn chessboard, if the position (x,y) of the knight is given, find the path which covers all the blocks of the chessboard without repeating.
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Coding