Meta·Software Engineer·Onsite - Coding / Algorithms
- Given a grid maze with start, end, wall, empty, and bomb cells, find the shortest path from start to end using 4-directional movement. Stepping on a bomb destroys all walls within Manhattan distance 2 from it. Return the minimum steps or -1 if unreachable.
“My first instinct was plain BFS and I started coding it before really thinking about state.”