RepostedWaymo logo

Waymo · Phone screen

Rejected

Waymo New Grad MLE Phone Screen: Traffic Lights: 1 Experience

Machine learning engineer · New GradDoctorateReported Nov 19, 2026
Shared byjanebeingjane

A 2026 Waymo new grad MLE phone screen: 45 minutes on one graph question, the fastest drive across a grid where cars wait at red lights.

At a glance

  • Process: applied online → HR reached out → one 45-minute phone screen with a coding question, where the code had to be run on two tests (report 01)
  • Asked recently: Shortest Travel Time in a Grid with Traffic Lights, a graph question (report 01)
  • Difficulty: the candidate rated it hard, wasn't very practised at graph questions, and did not pass (report 01)
  • Practise first: Shortest Travel Time in a Grid with Traffic Lights

Coverage: One new graduate with a PhD who applied online for a full-time machine learning engineering role. The report covers the phone screen only. The screen was in April 2026, and the report went up on November 19, 2026.

What came up

The one question was a shortest-time search on a grid, which the candidate counts as a graph question (report 01).

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Shortest Travel Time in a Grid with Traffic Lights 1 Apr 2026

1 detailed candidate timeline, loops, and screens

01: New grad MLE, 45-minute phone screen on a traffic light grid, not passed

Report date: November 19, 2026 · Interview date: April 2026 · Role: Machine learning engineer (asked later, the candidate called it an MLE-related role) · Degree listed: PhD · Channel: Applied online, then HR reached out · Candidate's rating: Neutral experience, hard · Result: Did not pass

Phone screen (45 minutes)

  1. In April the candidate sent out applications widely. HR got in touch, and a 45-minute phone screen was booked.
  2. From earlier Waymo reports by other people, the candidate had the impression that its phone screens like graph questions. This one was a graph question too.
  3. The question was Shortest Travel Time in a Grid with Traffic Lights. An m × n grid is a road map. A cell holds 0 for open road, 1 for a blocked cell, or 2 for a traffic light, which turns green once every T time units. A car starts at one given cell and must reach another. Each step goes up, down, left or right and costs one time unit, and at a red light the car waits for green. The answer is the least time to arrive, or -1 when there is no way through.
  4. The candidate wasn't very practised at graph questions. They used BFS (breadth-first search) and got some code written, haltingly. When it was time to run the code, two tests had to be run, and both printed the same output.
  5. The candidate failed the screen, which they say came as no surprise.

FastPrep's practice version keeps this task. The candidate doesn't say how long a light stays green, so FastPrep sets that rule: a light is green only at times T, 2T, 3T and so on, and the car can step onto a light cell only at those times.


Common questions

What does the Waymo MLE phone screen ask?

In report 01, one graph coding question in 45 minutes: the fastest way across a grid with obstacles and traffic lights. The code was run on two tests.

How hard is the Waymo new grad phone screen?

The candidate in report 01 rated it hard and did not pass.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.