Find Maximum Distance

This Wells_fargo coding interview problem presents an n x m grid with empty cells, obstacles (*), a start S, and an end E. You can move up, down, left, or right. The task is to find a path from S to E that maximizes the minimum Manhattan distance to any obstacle along the path and return that minimum distance. A concise interview question focused on grid navigation and distances.