Available question text
Given a 2D grid containing empty rooms/spaces (INF), walls/obstacles (-1), and gates (0), fill each empty room with the shortest distance to its nearest gate. Walls and gates remain unchanged. This is a classic multi-source BFS problem where all gates are enqueued simultaneously and distances are propagated outward in O(m*n) time.
Related questions
Continue with questions that share topics or the same question type.
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Count Pairs of Points With Distance k
Coding
- Count Subtrees With Max Distance Between Cities
Coding
- Count the Number of Houses at a Certain Distance I
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 3 records
DoorDash
Walls and Gates (Distance to Nearest Gate)
Reported Nov 1, 2026 · 14 source reports
JUNIOR, MID_LEVEL, PRINCIPAL, SENIOR, STAFF
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Walls and Gates (Distance to Nearest Gate)
Reported Apr 25, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceSpotify
Walls and Gates (Distance to Nearest Gate)
Reported Apr 29, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source