Minimum Knight Moves: coding question

Available question text

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.

Continue with questions that share topics or the same question type.

Word Ladder
Coding · Bidirectional Search · Breadth-First Search · Hash Table
Minimum Edge Reversals So Every Node Is Reachable
Coding · Breadth-First Search · Depth-First Search · Dynamic Programming
Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 4 records

Google
Leetcode 1197. Minimum Knight Moves
Reported Nov 24, 2025 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
LinkedIn
Leetcode 1197. Minimum Knight Moves
Reported Apr 6, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Meta
Leetcode 1197. Minimum Knight Moves
Reported Apr 13, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
Uber
Leetcode 1197. Minimum Knight Moves
Reported May 13, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

Available question text

Minimum Knight Moves

Available question text

Related questions

Minimum Knight Moves

Available question text

Related questions