Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2596. Check Knight Tour Configuration
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source