Practice Find Nearest Point That Has the Same X or Y Coordinate
Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.
Problem Statement
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).
Source: Find Nearest Point That Has the Same X or Y Coordinate on LeetCode. Use the original task for its coding environment and submissions.
Examples
# Example 1
x = 3, y = 4, points = [[1,2],[3,1],[2,4],[2,3],[4,4]]
2
# Example 2
x = 3, y = 4, points = [[3,4]]
0
# Example 3
x = 3, y = 4, points = [[2,3]]
-1
Constraints
Related LeetCode Problems
Practice more problems similar to Find Nearest Point That Has the Same X or Y Coordinate.
Review your practice with PhantomCodeAI
After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.