You are given a $2 ext{D}$ integer array drones, where drones[i] = [x_i, y_i, range_i] represents the coordinates $(x_i, y_i)$ and the maximum operating range range_i of the $i^{ ext{th}}$ drone. You are also given an integer array target = [tx, ty] representing the coordinates of a target.

The Manhattan distance between a drone at $(x_i, y_i)$ and the target at $(tx, ty)$ is calculated as $|x_i - tx| + |y_i - ty|$. A drone can reach the target if the Manhattan distance between them is less than or equal to its range_i.

Return the index of the drone that can reach the target with the minimum Manhattan distance. If there is a tie, return the smallest index. If no drone can reach the target, return $-1$.

Constraints:

• $1 \leq$ drones.length $\leq 100$

• drones[i].length $= 3$

• target.length $= 2$

• $-25 \leq x_i, y_i, tx, ty \leq 25$

• $1 \leq range_i \leq 100$

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.