You and your friend decided to meet at one of the N locations in the town. The ith location is located at (A[i], A[i]) on an infinite 2D grid.
You want to meet at the location with minimum x-coordinate. If there are multiple such locations, choose the one with the minimum y-coordinate. If there are still multiple such locations, you can choose any of them.
Your friend wants to meet at the location with minimum y-coordinate. If there are multiple such locations, choose the one with the minimum x-coordinate. If there are still multiple such locations, you can choose any of them.
Now, you need to find the distance between these two locations. The distance between (x1, y1) and (x2, y2) is |x1 - x2| + |y1 - y2| where |a| is the absolute value of a.
2 <= N <= 2 x 105
1 <= A[i], A[i] <= 109
There maybe multiple locations with the same coordinates.
A : [ [10, 10] [2, 9] [4, 6] ]Input 2:
A : [ [1, 3] [7, 5] ]
You will meet at (2, 9). Friend wants to meet at (4, 6). Distance between them is |2 - 4| + |9 - 6| = 5.Explanation 2:
(1, 3) has both minimum x and y coordinate.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.