← Waymo Interview InsightsSoftware Engineer

Waymo·Software Engineer·Technical Phone Screen·Senior

Senior
Jun 2026

Summary

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.

Questions Asked (1)

Q1

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.

Algorithms & Data StructuresSystem DesignTechnical Trade-offs
Author's notes

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

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying the problem constraints (graph size, edge weights, whether negative weights exist) and then propose Dijkstra's algorithm as the standard solution for non-negative weights. Discuss the trade-offs between different algorithms and data structures, and mention potential optimizations for large-scale graphs like those at Waymo.

Pro tip: Emphasize that in real-world mapping systems, precomputation and heuristics (like A* or contraction hierarchies) are often used to achieve low-latency queries, showing you understand production-scale challenges.

1. Clarify Requirements and Constraints

Ask about graph size, edge weight properties (non-negative, integer, etc.), and query frequency. This determines algorithm choice and optimization needs.

2. Choose the Right Algorithm

For non-negative weights, Dijkstra's algorithm is optimal. If negative weights exist, Bellman-Ford is needed. For very large graphs, consider A* with a heuristic or bidirectional search.

3. Select Data Structures

Use a priority queue (binary heap or Fibonacci heap) for efficient extraction of the minimum distance node. Adjacency list representation is typically best for sparse graphs.

4. Analyze Complexity and Trade-offs

Discuss time and space complexity: O((V+E) log V) with a binary heap. Compare with other algorithms and mention when to use each.

5. Discuss Optimizations and Real-World Considerations

Mention precomputation techniques (contraction hierarchies, landmarks), A* with admissible heuristics, and parallelization for large-scale systems.

Key Points to Mention

  • Dijkstra's algorithm for non-negative weights
  • Time complexity: O((V+E) log V) with binary heap
  • A* search with admissible heuristic for faster queries
  • Bidirectional search to reduce search space
  • Precomputation techniques like contraction hierarchies for static graphs
  • Handling of negative weights with Bellman-Ford if applicable

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.