Closest Distance Pair Problem Statement

Given an array containing 'N' points in a 2D plane, determine the minimum distance between the closest pair of points.

Note:

Distance between two points (x1, y1) and (x2, y2) is given by [(x1 - x2) ^ 2] + [(y1 - y2) ^ 2].

Input:

The first line contains a single integer 'N' denoting the number of points. The next 'N' lines each contain two integers separated by a space, representing the x and y coordinates of the points respectively.

Output:

The output should be the minimum distance between the 'N' points.

Example:

Input:
4
0 0
0 2
2 0
2 2

Output:
4

Constraints:

2

Question

Closest Distance Pair Problem Statement

Given an array containing 'N' points in a 2D plane, determine the minimum distance between the closest pair of points.

Note:

Distance between two points (x1, y1) and (x2, y2) is given by [(x1 - x2) ^ 2] + [(y1 - y2) ^ 2].

Input:

The first line contains a single integer 'N' denoting the number of points.
The next 'N' lines each contain two integers separated by a space, representing the x and y coordinates of the points respectively.

Output:

The output should be the minimum distance between the 'N' points.

Example:

Input:
4
0 0
0 2
2 0
2 2

Output:
4

Constraints:

2 <= 'N' <= 10⁵
-10⁵ <= 'x' <= 10⁵
-10⁵ <= 'y' <= 10⁵
Time Limit: 1 sec

Note:

You are not required to print anything; just implement the function.

Accepted Answer

The problem involves finding the minimum distance between the closest pair of points in a 2D plane.

Iterate through all pairs of points and calculate the distance between them using the given formula.
Keep track of the minimum distance found so far.
Optimize the solution by using techniques like sorting the points based on x or y coordinates.

Closest Distance Pair Problem Statement

Note:

Input:

Output:

Example:

Constraints:

Note:

Intuit Software Developer interview questions & answers

Popular interview questions of Software Developer