BFS Shortest Path with Moving Parade Obstacles

Problem Overview

The round is two graded parts in one phone screen (two first-hand reports, both rejected the next day). One report says it was written in Java with the whole screen shared. Neither candidate got Part 2 running: one finished Part 1 and only talked through Part 2; the other spent…

• 3 candidate-reported follow-ups — the exact probes interviewers asked, with the trigger for each
• The rest of the problem statement — full requirements, constraints, and edge cases
• Approach and trade-offs — what passing candidates did, and the mistakes that sink people