Find the minimum number of moves to travel from (x1, y1) to (x2, y2) in an infinite 2D grid, where you can move in 8 directions (horizontal, vertical, and diagonal).
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.