Online Assessment

OA with a Delivery-Cost, Truck-Collision, and Org-Tree Broadcast Problem

UberSoftware Engineer · Intern · Online Assessment · Jul 2026

OA Problem 1 There are n cities, each with a deliveryCharge value. Delivering from city i to city j can be costed in two ways: The cost is abs(deliveryCharge[i] - deliveryCharge[j]) If city j is city i's unique nearest city, the cost is 1 The distance between cities is defined as abs(deliveryCharge[i] - deliveryCharge[j]). Given a queries array where each entry is [Start, End], compute the minimu…

Shared by a candidate · reported Jul 2026. Interview formats change; use it as a guide, not a script.