Waymo Software Engineer Interview Questions

For coding round SWE at Waymo do you have to code 2 questions in 45 mins for phone scree?

Recently did an SWE coding phone screen. Between the 5 min intro, and 7 min questions at the end, I only have like 30ish mins for two questions. I coded the first one within like 20 mins, but that onl

waymo fulltime software engineer tech phone screen interview experience

刷题网 遗留斯 原题。 可惜没做过。。。竟然考bucket sort。坑坑巴巴写完了，但估计挂了

Waymo Autonomous Vehicle Senior Software Engineer Phone Interview

They asked very detailed questions about my resume, including some behavioral questions, such as how I recovered from a failed project, a project I'm particularly proud of, and how I handled conflicts

Waymo Internship Interview Experience and Questions

**Round 1** **Context** The session began with a discussion regarding project background, followed by a coding challenge. **Problem Statement** Given a list of tasks, where each task has a specific ID

#871 Minimum Number of Refueling Stops

LeetCode #871: Minimum Number of Refueling Stops. Difficulty: Hard. Topics: Array, Dynamic Programming, Greedy, Heap (Priority Queue). Asked at Waymo in the last 6 months.

#1944 Number of Visible People in a Queue

LeetCode #1944: Number of Visible People in a Queue. Difficulty: Hard. Topics: Array, Stack, Monotonic Stack. Asked at Waymo in the last 6 months.

#359 Logger Rate Limiter

LeetCode #359: Logger Rate Limiter. Difficulty: Easy. Topics: Hash Table, Design, Data Stream. Asked at Waymo in the last 6 months.

#528 Random Pick with Weight

LeetCode #528: Random Pick with Weight. Difficulty: Medium. Topics: Array, Math, Binary Search, Prefix Sum, Randomized. Asked at Waymo in the last 6 months.

Randomly Generate a Fully-Populated Grid with 4 Equal-Size Connected Components

## Problem Given an `m × n` grid, fill it completely with 4 tokens labeled `1, 2, 3, 4` such that: 1. Every cell is assigned exactly one token (no empty cells). 2. Each token must occupy the **same n

Count Same-Color Squares in a Grid

## Problem: Count Same-Color Squares in a Grid You are given a 2D grid `grid` of characters. Each cell contains an uppercase letter (e.g., `A/B/C/D`) representing a color. The grid size is arbitrary

Maximum Area Axis-Aligned Rectangle From Points

Given a set of points `points` on a 2D plane, where each point has integer coordinates `(x, y)`. Find the **maximum area** of an **axis-aligned** rectangle whose four vertices all appear in `points`.

Minimum travel path for a pen-plotter to draw given strokes

## Problem: Minimum travel path for a pen-plotter to draw given strokes You are implementing a pen-plotter robot that moves a pen on paper to draw a figure. You are given **n strokes**, each stroke b

Parse CSV String Into a Usable Data Structure (with Corruption Handling)

## Problem: Parse a CSV String into a Usable Data Structure (with Corruption Handling) Given a CSV-formatted string `s` that may be **clean or corrupted**, parse it into a data structure convenient f

Reachability / Jump Game Variant (Backtracking)

## Problem: Jump Game Variant (Reachability / Backtracking) Given an integer array `nums` of length `n`, you start at index `0`. - `nums[i]` is the **maximum** jump length from index `i` to the righ

Prefix Word Search Data Structure (Trie Autocomplete)

## Problem: Prefix Query (Trie Autocomplete) Given a list of words `words` (lowercase letters a-z only), build a data structure that supports: 1. `build(words)`: insert all words into the structure.