How should I practice Shortest Directed Cycle Through a Start Node?

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

Is Shortest Directed Cycle Through a Start Node 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 Directed Cycle Through a Start Node

Google● MediumNEW GRADONSITE INTERVIEW

Learn

Problem statement

A directed graph has nodeCount nodes numbered from 0 through nodeCount - 1 and directed edges [from, to].

Given start, return the number of edges in the shortest directed cycle that begins at start and returns to start. Return -1 when no such cycle exists.

A self-loop [start, start] is a cycle of length 1.

Function

shortestCycleFromStart(nodeCount: int, edges: int[][], start: int) → int

Examples

Example 1

nodeCount = 4edges = [[0,1],[1,2],[2,0],[1,3]]start = 0return = 3

Cycle 0→1→2→0 has three edges.

Example 2

nodeCount = 3edges = [[0,0],[0,1],[1,0]]start = 0return = 1

The self-loop is shorter than cycle 0→1→0.

Example 3

nodeCount = 4edges = [[0,1],[1,2],[2,3]]start = 0return = -1

No directed path returns to node 0.

Constraints

1 <= nodeCount <= 100000.
0 <= edges.length <= 200000.
0 <= from, to, start < nodeCount.
Duplicate directed edges may appear.