Skip to interview prep
Apexed

358. How do you find the closest pair of points in 1D and in 2D in O(n log n)?

HardDivide & conquer

Technical

Write a solution in JavaScript or Python, add a few test calls that print results and press Run. This is ungraded practice: Run shows output and does not check correctness. Open the Model answer tab to compare. Your code is saved in this browser.

Tab indents · Ctrl/⌘ + Enter runs · Esc then Tab leaves the editor

Press Run to see your program’s output.

How do you find the closest pair of points in 1D and in 2D in O(n log n) — Data structures & algorithms interview question — Apexed