Select the best dasher for an order

Q: Select the best dasher for an order

This problem evaluates algorithmic selection and geometric computation skills—filtering eligible dashers, calculating Euclidean distances, and applying deterministic tie-breaking—within the Coding & Algorithms domain at an implementation-level algorithmic abstraction.

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

You need to assign an order to a dasher.

Input:

An order with a pickup location (x, y) .
A list of dashers , each with:
- id
- current location (x, y)
- is_available boolean

Requirements:

Only available dashers are eligible.
Choose the eligible dasher with the smallest Euclidean distance to the pickup location.
If there is a tie, choose the dasher with the smallest id .
Return the selected dasher_id , or null if none are available.

Task: Implement the selection function and analyze its time complexity.

Select the best dasher for an order

Quick Overview

Comments (0)