Shortest Distance from All Buildings: coding question

Available question text

Given a grid with buildings (1), empty land (0), and obstacles (2), find an empty cell that minimizes the sum of shortest (Manhattan) path distances from all buildings while avoiding obstacles; return that minimum sum or -1 if no empty cell is reachable from every building. This problem primarily requires repeated BFS distance accumulation and reachability checks from each building to identify the globally optimal empty location.

Continue with questions that share topics or the same question type.

Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
Shortest Path in a Grid with Obstacles Elimination
Coding · Array · Breadth-First Search · Matrix
Shortest Path in Binary Matrix
Coding · Array · Breadth-First Search · Matrix
Contain Virus
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 5 records

Amazon
Leetcode 317. Shortest Distance from All Buildings
Reported Nov 19, 2025 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
Coupang
Leetcode 317. Shortest Distance from All Buildings
Reported Aug 18, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source
DoorDash
Leetcode 317. Shortest Distance from All Buildings
Reported May 7, 2026 · 3 source reports
MID_LEVEL, STAFF
Source snapshot: Nov 12, 2026
View source
Goldman Sachs
Leetcode 317. Shortest Distance from All Buildings
Reported Jul 27, 2026 · 1 source report
SENIOR

Available question text

Shortest Distance from All Buildings

Available question text

Related questions

Shortest Distance from All Buildings

Available question text

Related questions