Find nearest courier for each customer

Q: Find nearest courier for each customer

This is a Coding & Algorithms interview question from DoorDash for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given two sets of 2D points: customers C = {c1..cn} and active couriers D = {d1..dm}, return for every customer the nearest courier by geographic distance (assume Euclidean or great-circle; specify which). Provide an algorithm beyond the O(n*m) brute force, discuss appropriate spatial data structures (e.g., k-d tree, R-tree, uniform grid hashing), and analyze time and space complexity. Address tie-breaking, handling duplicate locations, and precision issues. Follow-ups: how would you support frequent dynamic updates to courier locations, batch queries, or constraints like maximum pickup radius?

Find nearest courier for each customer

Comments (0)