Compute nearest-exit distances in a grid

Q: Compute nearest-exit distances in a grid

This question evaluates proficiency in graph traversal and shortest-path concepts applied to grid-based problems, including handling obstacles, Manhattan distance computation, and extensions to multi-layer (3D) grids and weighted movement.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

You are given a 2D grid representing a building floor with three cell types: -1 for walls, 0 for exits, and a large sentinel value for empty rooms. Update each empty room with the Manhattan distance (4-directional moves) to its nearest exit; if unreachable, leave it as the sentinel value. Solve it efficiently and analyze time and space complexity. Follow-ups: extend to a 3D grid (multiple floors) and to weighted movement costs.

Compute nearest-exit distances in a grid

Overview

Comments (0)