Amazon Warehouse Closest Pair of Points
Amazon Warehouse Closest Pair of Points
MediumAlgorithms0% accepted
Amazon drones fly between warehouse coordinates. Find the pair of points with the minimum Euclidean distance using divide and conquer in O(n log n).
Approach
Closest pair of points using divide and conquer algorithm.
Input
4
0 0 3 4 1 1 5 2
Output
1.41
More Algorithms problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards