Leetcode 1066. Campus Bikes II
Given coordinates of workers and bikes, assign each worker a distinct bike to minimize the total Manhattan distance; the combinatorial assignment is solved via exponential-state bitmask DP or memoized recursion over workers with a bitmask of chosen bikes.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.