← Questions
Cell with the least total walking distance to all targets around walls
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A grid has targets, empty cells and walls. Walking moves up, down, left or right and cannot cross walls. Find a non-wall cell whose summed walking distance to every target is as small as possible and return that sum (or report that no cell reaches all targets).
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