← Questions
Best locker location on a grid with obstacles
0
I was asked this
No reports yet. Sign in to say where you were asked it.
On a grid with obstacles, choose an empty cell for a locker so that the total walking distance to it from a set of given locations is as small as possible, walking around obstacles. Return the best cell or its total distance.
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