You are given two integers x and y, which represent your current location (x, y) on a $2 ext{D}$ coordinate grid. You are also given an array points where each points[i] $= [a_i, b_i]$ denotes a point on the same grid.

A point is valid if it shares either the same x coordinate or the same y coordinate as your current location (that is, $a_i =$ x or $b_i =$ y).

Return the $0$ based index of the valid point that has the smallest Manhattan distance to your current location. If multiple valid points share the same minimum Manhattan distance, return the one with the smallest index. If no valid point exists, return $-1$.

The Manhattan distance between two coordinates $(x_1, y_1)$ and $(x_2, y_2)$ is defined as $|x_1 - x_2| + |y_1 - y_2|$.

Constraints:

• $1 \leq$ points.length $\leq 10^4$

• points[i].length $= 2$

• $1 \leq$ x, y, a_i, b_i $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.