NeetCode #612LC-1197MediumGraphsNC Algo100
← Back to All Problems#612 · #1197 · Minimum Knight Moves(进击的骑士)
📌 Problem Statement & Constraints
A knight moves on an infinite chessboard. Given
x and y, return the minimum number of moves to reach (x, y) from (0, 0). Constraints: -300 <= x, y <= 300.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!