InterviewDB Question

Waymo SWE Onsite - Minimum Cost Connecting

Question Details

Problem Find the minimum cost to connect all nodes in a graph, likely a minimum spanning tree problem. Likely LeetCode equivalent LC 1584 (Min Cost to Connect All Points) is closely related. Tags graph, greedy, minimum-spanning-tree

Full Details

🔒

Unlock all Waymo questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a waymo interview during the onsite round.

It covers the following topics: Coding, Graph, Greedy, Onsite .