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.

Asked at:

Google

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Late May, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2812. Find the Safest Path in a Grid

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact