Available question text
Given a directed functional graph (each node has at most one outgoing edge, possibly with cycles), find the node reachable from both node1 and node2 that minimizes the maximum of the two directed distances to it (return the smallest index on ties), or -1 if no such common reachable node exists.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2359. Find Closest Node to Given Two Nodes
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source