← Google questions
CodingReported in a candidate post, Jan 2025

Knight's tour on an infinite grid

Filed under Google

The report calls this the classic knight movement problem on an infinite grid. The standard version: a knight starts at (0, 0) on an infinite chessboard; return the minimum number of moves to reach…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.