Available question text
Given a grid with trucks, obstacles, and boundary dispatch points, find the minimum time to dispatch all trucks using BFS propagation. Follow-up involves weighted propagation where each cell has different dispatch delays, requiring shortest-path algorithms instead of uniform BFS.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Multi-Source BFS with Obstacles and Variable Weights
Reported Feb 18, 2026 · 2 source reports
JUNIOR, MID_LEVEL
Source snapshot: Nov 12, 2026
View source