How should I practice Shortest Round Trip Through All Deliveries?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Shortest Round Trip Through All Deliveries associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Graph

Shortest Round Trip Through All Deliveries

● Hard

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

You are given a rectangular grid containing one start, open cells, obstacles, and delivery points:

S is the unique start.
D is a delivery point.
. is an open cell.
# is an obstacle.

From an open cell, the courier may move one cell up, down, left, or right at unit cost. The courier must start at S, visit every D at least once in any order, and return to S.

The problem statement continues

Pro

Examples

Example 1

grid = ["S.D","...","D.."]return = 8

Each delivery is two steps from the start, and the two deliveries are four steps apart. Visiting them in either order and returning costs 2 + 4 + 2 = 8.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
1 more worked example, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week