How should I practice Shortest Path Node Count Avoiding Broken Nodes?

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

Is Shortest Path Node Count Avoiding Broken Nodes associated with Google?

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

Shortest Path Node Count Avoiding Broken Nodes

Google● MediumFULLTIMENEW GRADINTERNONSITE INTERVIEW

Problem statement

You are given a directed graph as an adjacency list, a list of broken node indices, a start node, and a destination node. Return the minimum number of nodes on a directed path from start to destination that never visits a broken node. Count both endpoints.

Return -1 when no valid path exists. If start equals destination and that node is not broken, return 1. If either endpoint is broken, return -1.

The problem statement continues

Pro

Examples

Example 1

graph = [[1,2],[3],[4],[4],[]]broken = [1]start = 0destination = 4return = 3

With node 1 blocked, the shortest valid path is 0 to 2 to 4 and contains three nodes.

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

See Google hiring insights