BFS Shortest Path with Moving Parade Obstacles

Phone ScreenZipLast reported July 2026Low Frequency
Reported
2× across candidate reports
First seen
October 2025
Last reported
July 2026
Reported outcome
unknown

Problem Overview

You are a taxi driver on an infinite 2D grid city where roads run north-south and east-west (intersections represented as (x, y) coordinates). You start at a given location (Cab) and must reach a Destination by moving one step at a time in cardinal directions (N/S/E/W). PART 1: Given a…

  • 4 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
Unlock the full Zip catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Zip question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?