How should I practice Choose a Shortest Path That Avoids Bob?

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

Is Choose a Shortest Path That Avoids Bob associated with Google?

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

Choose a Shortest Path That Avoids Bob

Google● HardFULLTIMEONSITE INTERVIEW

Problem statement

Alice and Bob move simultaneously along one edge per second in an undirected, unweighted graph. Alice must choose a shortest path from her start to the destination. Bob may choose any walk to catch her.

The problem statement continues

Pro

Examples

Example 1

n = 5edges = [[0,1],[1,4],[0,2],[2,3],[3,4]]aliceStart = 0bobStart = 3destination = 4return = false

Alice takes 0-1-4; Bob reaches the destination too late.

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
2 more worked examples, 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

See Google hiring insights