Waymo Interview Questions — 10 DSA Problems

6 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Waymo LeetCode questions for software engineering interviews.

• Max Points on a Line (HARD) — Array, Hash Table, Math, Geometry
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Shortest Distance from All Buildings (HARD) — Array, Breadth-First Search, Matrix
• Minimum Knight Moves (MEDIUM) — Breadth-First Search
• Possible Bipartition (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Valid Sudoku (MEDIUM) — Array, Hash Table, Matrix
• Divide Array in Sets of K Consecutive Numbers (MEDIUM) — Array, Hash Table, Greedy, Sorting
• Design Tic-Tac-Toe (MEDIUM) — Array, Hash Table, Design, Matrix, Simulation
• Find Peak Element (MEDIUM) — Array, Binary Search