← Questions
Place K pickup points to minimize total L1 distance
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given the coordinates of N people, choose K shuttle pickup locations so that the sum of each person's Manhattan (L1) distance to their nearest pickup is as small as possible.
Discuss exact approaches for small inputs and a k-medians style iteration (the median per coordinate minimizes L1 within a cluster).
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding