Leetcode 1197. Minimum Knight Moves
Given target coordinates (x, y), find the minimum number of knight moves required to reach that square from (0,0) on an infinite chessboard. This is a shortest-path problem on an implicit unweighted grid graph (solveable with BFS/bi‑directional BFS or A*), often simplified by exploiting symmetry to the first quadrant.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Early November, 2022
Mid-level
Find minimum number of moves for a knight to reach a given end point on an infinite chess board
Early November, 2022
Mid-level
Find minimum number of moves for a knight to reach a given end point on an infinite chess board with blocked points
Your account is free and you can post anonymously if you choose.