Waymo Software Engineer interview questions

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

46 Software Engineer interview notes

Waymo·Software Engineer·Technical Phone Screen

Jul 2026
Waymo software engineer interview with a tree serialization problem that I did not handle well. Ran out of time before finishing even the basic case, never mind edge cases. Not my best 45 minutes.
  • Given a syntax tree where each node is either a variable or one of the four basic operators (+, -, *, /), serialize the tree into a string using the minimum number of parentheses needed.

“This wrecked me.”

View Post

Waymo·Software Engineer·Hiring Manager Screen

Jul 2026
Waymo HM screen for a software engineer role, no technical questions at all, just a career walkthrough and some light probing on annotation concepts. The HM was genuinely engaging and spent a good chunk of time pitching the team's self-driving work, which made the rejection feel like a gut punch when it finally came through after I had to chase the recruiter for an update.
  • Walk me through your background and the tech stack you've worked with.
  • Tell me about a project you owned end to end and delivered.
  • What's the difference between annotation and labeling in the context of machine learning data pipelines?

“Standard opener, I had rehearsed this with a coach so it went fine.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview with a string manipulation problem. Pretty standard coding round, nothing too wild, but the question had a specific approach they seemed to want.
  • Given two strings, one defining a custom character ordering and one as the target, rearrange the target string so its characters appear in the order defined by the first string. Characters not present in the ordering string can go anywhere.

“The core idea clicks pretty fast: count frequencies in the target, then walk through the ordering string and append each character the right number of times, then tack on whatever's left.”

View Post

Waymo·Software Engineer·Onsite - Cross-functional / Panel

Jun 2026
Waymo's data fluency round is its own beast. There's barely any prep material out there for it, and the interviewer spent so much time on background context that I barely had room to actually answer anything. Left feeling pretty unsure about how it went.
  • What metrics would you use to measure progress in autonomous driving development?
  • Given two sets of experimental data from different approaches, which one performs better and why?

“This one tripped me up more than I expected.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo SWE interview that centered on a classic frequency counting problem, but don't let that fool you. They pushed hard on knowing multiple approaches cold and being able to reason through the tradeoffs on the spot.
  • Given an array of elements, count how many times each element appears. Walk through multiple approaches and discuss the complexity and tradeoffs of each.

“Started with the hash map solution which is the obvious answer, O(n) time and O(k) space where k is distinct values.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Phone screen for a software engineer role at Waymo. The technical portion was an object-oriented design problem built around a real-ish business scenario, and the interviewer seemed way more interested in how I was thinking through the problem than whether I got to a clean solution fast.
  • Design a class that processes two types of timestamp-based signals and returns continuous time intervals satisfying certain conditions.

“The problem sounds manageable until you realize there are a bunch of edge cases around how the two signal types interact near interval boundaries.”

View Post

Waymo·Software Engineer·Onsite - System Design / Architecture

Jun 2026
System design round at Waymo focused entirely on data storage at scale. No coding, just a long open-ended conversation about storage choices and schema design. Felt more like a senior architecture discussion than a typical SWE interview.
  • How would you decide between a relational database, a NoSQL store, and a columnar warehouse for storing large volumes of data?
  • Given a set of access patterns, how would you design the schema including entities, relationships, indexes, and partitioning keys?
  • How do you balance schema and storage design for a workload that needs to support both real-time writes and heavy analytics queries?

“This is the kind of question where you think you know the answer until you're actually saying it out loud.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo coding round with a string decoding problem that's basically a twist on 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. Handle nested cases like "a(b(c){2}){2}".

“It's a variant of that string decode problem on LeetCode but with different syntax.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Phone screen for a software engineer role at Waymo. Hadn't touched leetcode in a while and it showed. The interviewer was pretty understanding about it, which honestly made it worse somehow.
  • Given a binary tree and an array, determine whether the array represents a valid root-to-leaf path in the tree.

“Blanked.”

View Post

Waymo·Software Engineer·Technical Phone Screen

Jun 2026
Waymo software engineering interview with a coding problem centered on run-length encoded strings. Pretty algorithmic, felt like a classic phone screen but with enough depth to keep you on your toes if you only prepped the naive solution.
  • Given a run-length encoded string like 'B1A2E3C1' (which decodes to 'BAAEEEC'), implement a Find(int p) function that returns the character at position p in the decoded string without actually decoding the whole thing. Then discuss both an O(n) and an O(log n) approach, and handle edge cases like p being out of range or counts being multi-digit.

“I started with the linear scan pretty naturally, just walk the pairs and track a running total until you hit the segment containing p.”

View Post