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.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1066. Campus Bikes II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact