Algorithms for Coding Interviews in C++/

...

/

Challenge: Closest Pair of Points

Challenge: Closest Pair of Points

In this lesson, we will solve a challenge on finding the closest pair of points in Euclidean space.

We'll cover the following...

Closest Pair of Points

In a 2D Euclidean plane, the closest pair of points is the one which has the minimum distance between them.

Reminder: Distance between two points in a 2D Euclidean plane can be calculated using the Euclidean formula:

∣∣pq∣∣=sqrt[(px−qx)2+(py−qy)2]||pq|| = sqrt[(p_x - q_x)^2 + (p_y - q_y)^2]
...