Leetcode 2596. Check Knight Tour Configuration

Given an n×n grid where grid[r][c] is the step number when a knight visited that cell, verify the configuration is a valid knight's tour: the tour starts at (0,0) with 0 and for every k from 0 to n*n-2 the cell with k+1 is a legal knight move away from the cell with k.