Available question text
Given a directed graph formed by adding one extra edge to a rooted tree, identify which single edge (returning the one that appears last in the input when multiple choices exist) to remove so every node has exactly one parent and the graph becomes a rooted tree; the core challenge is handling the two cases where the extra edge creates either a node with two parents or a directed cycle.
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 685. Redundant Connection II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source