BFS Shortest Path with Moving Parade Obstacles
Zip interview questions · Hard · Phone Screen round · reported 2× · 6 tests
Compute the fastest arrival time on a grid where fixed walls and slowly advancing parades block cells as time passes.
The full question, tests and reference solution are available with a plan that includes Zip.
Run your code with Ctrl+Enter to see results.