Leetcode 2812. Find the Safest Path in a Grid

Compute each cell's Manhattan distance to the nearest thief, then find a path from (0,0) to (n-1,n-1) that maximizes the minimum of those distances along the path — a max‑min (bottleneck) path problem on a grid.