DIY: Walls and Gates
Explore how to implement the walls and gates problem by computing shortest distances from gates to empty rooms in a grid. This lesson helps learners develop skills to solve grid-based pathfinding challenges often seen in Amazon coding interviews.
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 | |