Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Campus Bikes
Coding
- Bikes Last Time Used
Coding
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1066. Campus Bikes II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source