Loading Company...
This is a verified interview question from Amazon-ml-summer-school. Candidates reporting seeing this problem in recent Online Assessments (OAs) and onsite rounds. Mastering "Minimum Time to Occupy Every Cell of the Board" covers key patterns like Other.
"A lone knight is moving on an NXN chessboard. The knight moves from cell (xi, yi) to cell (x2, y2) if |x1 - x2| = 1 or |y1 - y2| = 1. The goal is to determine the minimum amount of time required for the knights to occupy every cell of the board, starting from the given coordinates of the knight."
Join thousands of developers practicing for Amazon-ml-summer-school.