Gamified challenge · Multi-source BFS
rooms is a floor plan: -1 is a wall, 0 is a gate and 1 is an empty room. You can step up, down, left or right between cells that aren't walls.
Write gateDistances(rooms) that returns a grid of the same shape where walls stay -1, gates stay 0, and every room holds the fewest steps to any gate. A room that no gate can reach gets -1.
Example: [[1, -1, 0, 1], [1, 1, 1, -1], [1, -1, 1, -1], [0, -1, 1, 1]] → [[3, -1, 0, 1], [2, 2, 1, -1], [1, -1, 2, -1], [0, -1, 3, 4]].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google