Closest Pair of Points Problem Statement

Given an array containing 'N' points in a plane, your task is to find the distance between the closest pair of points.

Explanation:

The distance between two points, (x1, y1) and (x2, y2), is calculated using the formula: [(x1 - x2) ^ 2] + [(y1 - y2) ^ 2].

Input:

N
x1 y1
x2 y2
...
xN yN

Output:

The smallest distance between the closest pair of points among the given 'N' points.

Example:

Input:

4
0 0
1 1
-1 -1
2 2

Output:

2

Constraints:

• 2 ≤ 'N' ≤ 10⁵
• -10⁵ ≤ 'x' ≤ 10⁵
• -10⁵ ≤ 'y' ≤ 10⁵
• Time Limit: 1 second

Note:

You do not need to print anything; it has already been taken care of. Simply implement the provided function.