]] Output: false Explanation: The above diagram represents the grid. The 8th move of the knight is not valid considering its position after the 7th move.

Constraints

n == grid.length == grid[i].length
3 <= n <= 7
0 <= grid[row][col] < n * n
All integers in grid are unique.

Solution

Method 1 – Sequential Move Validation

Intuition

A valid knight tour must start at (0,0) and each move from step k to k+1 must be a valid knight move. We can map each move number to its position and check all consecutive moves.

Reasoning

By storing the position of each move, we can check if each consecutive move is a valid knight move (i.e., the difference in coordinates is (2,1) or (1,2) in any direction). If all moves are valid, the configuration is valid.

Approach

Create a mapping from move number to (row, col) position.
Check that move 0 is at (0,0).
For each move from 0 to n*n-2:
- Get the current and next positions.
- Check if the move is a valid knight move (abs(dx), abs(dy)) in [(1,2),(2,1)].
- If any move is invalid, return false.
If all moves are valid, return true.

Edge cases:

Related Tags