Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Walls and Gates
Bookmark
BFS per Room
Multi-Source BFS
Input
Example 1
Simple
No gates
All gates
Custom
rooms
=
[[2147483647,-1,0,2147483647],[2147483647,2147483647,2147483647,-1],[2147483647,-1,2147483647,-1],[0,-1,2147483647,2147483647]]
INF
W
G
INF
INF
INF
INF
W
INF
W
INF
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
INF
W
G
INF
INF
INF
INF
W
INF
W
INF
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
INF
W
G
INF
INF
INF
INF
W
INF
W
INF
W
G
W
INF
INF
(2,0)
front / rear
queue
Gate
Wall
Empty
Filled
3
W
G
1
INF
INF
INF
W
INF
W
INF
W
G
W
INF
INF
(1,0)
front / rear
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
INF
INF
W
INF
W
INF
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
INF
W
INF
W
INF
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
1
W
1
W
INF
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
1
W
1
W
2
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
1
W
1
W
2
W
G
W
INF
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
1
W
1
W
2
W
G
W
3
INF
queue
Gate
Wall
Empty
Filled
3
W
G
1
2
2
1
W
1
W
2
W
G
W
3
4
queue
Gate
Wall
Empty
Filled
algo
master
.
io
Step:
Start: Fill each empty room by searching outward for its nearest gate
0 / 190
Input
Example 1
Simple
No gates
All gates
Custom
rooms
=
[[2147483647,-1,0,2147483647],[2147483647,2147483647,2147483647,-1],[2147483647,-1,2147483647,-1],[0,-1,2147483647,2147483647]]
0 / 190
algo
master
.
io
Step:
Start: Fill each empty room by searching outward for its nearest gate
