NeetCode #529LC-1057MediumHeap / Priority QueueNC Algo100
← Back to All Problems#529 · #1057 · Campus Bikes(校园自行车分配)
📌 Problem Statement & Constraints
Given
workers and bikes coordinates on a grid, assign each worker a distinct bike minimising the total Manhattan distance, with tie-breaks: smallest worker index first, then smallest bike index. Return the assignment. Constraints: 1 <= workers.length <= bikes.length <= 1000.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!