← Google questions
CodingReported in a candidate post, Jul 2025

Minimum steps for a knight on an infinite chessboard

Filed under Google

Find the minimum number of moves for a knight to travel from (0,0) to (x,y) on an infinite chessboard.

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.