How should I practice Directed Graph Reachability Queries?

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

Is Directed Graph Reachability Queries 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

Directed Graph Reachability Queries

● Hard

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

You are given a directed graph with n vertices numbered from 0 to n - 1. Each pair [from, to] in edges adds a directed edge from from to to.

For every pair [source, target] in queries, determine whether a directed path exists from source to target.

The problem statement continues

Pro

Examples

Example 1

n = 4edges = [[0,1],[1,2],[2,3]]queries = [[0,3],[3,0],[1,1],[0,2]]return = [true,false,true,true]

The path 0 -> 1 -> 2 -> 3 makes 3 reachable from 0. There is no path from 3 back to 0. Vertex 1 reaches itself, and 0 reaches 2.

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

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week