Best meeting point on a grid
A grid marks several people's (or points') positions. Find the cell that minimizes the total distance to all of them. Start with a brute force (for example a BFS from each point), then note that with Manhattan distance and no obstacles the rows and columns can be solved separately with medians.
No answer yet. Write the first one; the best answer gets endorsed.