Quick Overview

This question evaluates understanding of shortest-path algorithms and reachability in weighted graphs (including directed vs. undirected handling and paths that must include an intermediate node) as well as interval scheduling and resource-allocation skills for minimizing and assigning concurrent rental requests.

Solve Shortest Paths and Rental Allocation

Company: Google

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Onsite

Quick Answer: This question evaluates understanding of shortest-path algorithms and reachability in weighted graphs (including directed vs. undirected handling and paths that must include an intermediate node) as well as interval scheduling and resource-allocation skills for minimizing and assigning concurrent rental requests.

Loading…