JuniorArray

Find Nearest Point That Has the Same X or Y Coordinate

You are given two integers, x and y, which represent your current location on a Cartesian grid: (x, y). You are also given an array points where each points[i] = [ai, bi] represents that a point exists at (ai, bi). A point is valid if it shares the same x-coordinate or the same y-coordinate as your location.

Return the index (0-indexed) of the valid point with the smallest Manhattan distance from your current location. If there are multiple, return the valid point with the smallest index. If there are no valid points, return -1.

The Manhattan distance between two points (x1, y1) and (x2, y2) is abs(x1 - x2) + abs(y1 - y2).

Example 1
Inputx = 3, y = 4, points = [[1,2],[3,1],[2,4],[2,3],[4,4]]
Output2
Of all the points, only [3,1], [2,4], and [4,4] are valid; [2,4] and [4,4] have distance 1, and [2,4] has the smallest index, so return 2.
Example 2
Inputx = 3, y = 4, points = [[3,4]]
Output0
The answer is allowed to be on the same location as your current location.

Constraints

  • 1 <= points.length <= 10^4
  • points[i].length == 2
  • 1 <= x, y, ai, bi <= 10^4

Asked at 3 companies

</>

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Loading...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, missed edge cases, and complexity analysis of your solution.

Sign in to evaluate