DIY: Walls and Gates
Explore how to implement the walls and gates algorithm in Rust to fill empty rooms in a 2D grid with the shortest distance to the nearest gate. This lesson helps you understand applying breadth-first search techniques to solve real Amazon interview questions, preparing you to tackle similar problems efficiently.
We'll cover the following...
We'll cover the following...
Problem
You are given a grid represented by a 2D array named rooms. The grid represents rooms where a cell can either be a wall, a gate, or an empty space. The rooms are initialized with these three possible values.
| Values | Represents |
|---|---|
| A wall or an obstacle | |