Quick Overview

This question evaluates graph and grid traversal concepts, specifically multi-source shortest-path computation on a grid and handling special-cell constraints such as obstacles that cannot be used as intermediate steps.

Compute Nearest Destination Distances

Company: DoorDash

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: easy

Interview Round: Technical Screen

Overview: This question evaluates graph and grid traversal concepts, specifically multi-source shortest-path computation on a grid and handling special-cell constraints such as obstacles that cannot be used as intermediate steps.

Read the full DoorDash Software Engineer interview experience this question came from

Loading…