Waymo Software Engineer interview questions

38 Software Engineers have shared notes from their Waymo interviews, with the questions they were asked in each round. That is 72% of the 53 Waymo interview notes on Screna AI.

38 Software Engineer interview notes

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo software engineer interview with a tree serialization problem that I just could not crack in time. Left feeling pretty rough about it.
  • Given a syntax tree where each node is either a variable or an operator (plus, minus, multiply, divide), serialize the tree into a string using the minimum number of parentheses.

“Never really practiced this kind of problem and it showed badly.”

View Post

Waymo·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Waymo system design round, one big open-ended question about building an evaluation platform from scratch. Dense problem with a lot of moving parts and I felt like I was constantly choosing which thread to pull on.
  • Design an evaluation platform that supports both human reviewers and LLM-based judges. Your design should cover how tasks get ingested and routed, how you manage a mixed pool of human and automated evaluators, quality control mechanisms like gold tasks and inter-annotator agreement, how you aggregate results into a consensus, throughput and SLA guarantees, cost trade-offs between human and LLM evaluation, and what APIs you expose to customers.

“This is a beast of a question.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview with a graph/routing question that felt pretty applied given what the company actually builds. One question, clean setup, but the follow-ups are where things get interesting.
  • You have a graph of map nodes connected by weighted undirected edges representing travel times. Given a source node and a destination node, compute the estimated travel time between them.

“Pretty much a Dijkstra question dressed up in autonomous vehicle clothing.”

View Post

Waymo·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Waymo SWE interview, coding round. One meaty in-place matrix copy problem that seemed straightforward until the overlap case came up and I realized I hadn't thought it through.
  • Given a 2D matrix and two rectangular regions (each defined by a top-left corner, height, and width), copy the source rectangle into the destination rectangle in-place using O(1) extra memory. The rectangles may overlap. How do you handle the iteration order to avoid corrupting source data before it's been read, and what do you do about out-of-bounds destinations?

“My first instinct was just nested loops top-to-bottom, left-to-right and I coded it up pretty confidently.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview that threw a pretty gnarly low-level data structures problem at me. The kind of question where you think you know what they want and then realize halfway through you've been assuming too much.
  • Without using any built-in hash maps, sets, or dictionaries, implement a frozenset-like immutable collection from scratch. It needs to support membership testing, length, iteration, equality comparison, and produce a stable hash. You have to build the underlying hash table yourself using only raw arrays.

“I started with chaining because open addressing felt like more surface area to mess up under pressure.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo software engineer interview with a coding problem that looks simple on the surface but bites you if you forget about the negative coefficient case. The two-pointer insight is the whole game here.
  • Given a sorted integer array and three coefficients a, b, c, apply the quadratic function f(x) = a*x^2 + b*x + c to every element and return the results in sorted order.

“My first instinct was to just map and sort, which is O(n log n) and they clearly wanted better.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview with a grid partitioning problem that I fumbled pretty badly in the moment. The concept seemed approachable at first but the randomness constraint completely derailed my BFS approach and I had to look up the right direction afterward.
  • Given a 4-token set and an m×n grid, design an algorithm to randomly populate the grid so that each token occupies exactly m*n/4 cells, each token's region is fully connected (4-directional adjacency), and the entire grid is covered.

“I went straight to BFS and got a working structure on paper, but the randomness part broke everything.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview with a streaming algorithms problem that had a neat follow-up. The core question was well-designed and pushed into some practical engineering territory with the per-user extension.
  • You're given a chronologically ordered stream of events, each with a type and timestamp. A 'streak' is a maximal run of the same event type where consecutive events are no more than max_gap apart in time. A 'Super Streak' is any streak with at least L events and a total duration of at least D. Count the number of Super Streaks using a single forward pass.
  • Follow-up: each event now also has a user_id. How do you count Super Streaks per user?

“The single-pass constraint is what makes this interesting.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview with a string sorting problem. Pretty standard coding round, nothing too wild, but the solution has a specific pattern worth knowing cold before you go in.
  • Given two strings, one defining a custom character order and one as the target, rearrange the target string so its characters appear in the order defined by the first string. Characters not in the order string can go anywhere.

“The approach clicked once I stopped overthinking it.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo coding round with a string decoding problem that's basically a variant of a classic LeetCode problem. Nothing too wild but the nested case tripped me up a bit.
  • Given an encoded string like "abs(cs){3}g", decode it so that substrings inside parentheses are repeated by the number in the following curly braces. Nested repetitions are also possible, e.g. "a(b(c){2}){2}".

“I recognized it as close to a well-known decode string problem and jumped straight to a stack approach.”

View Post