Quick Overview

This question evaluates proficiency in graph algorithms and shortest-path computation, specifically handling weighted directed graphs, non-negative travel times, and reachability.

Compute ETA between two map nodes

Company: Waymo

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Quick Answer: This question evaluates proficiency in graph algorithms and shortest-path computation, specifically handling weighted directed graphs, non-negative travel times, and reachability.

Loading…