Practice Uber Coding Question | Real Coding Interviews

Quick Summary

Find a root node in a directed tree that minimizes the number of edge reversals required to make all edges point away from it.
The input guarantees a tree structure with exactly n-1 directed edges connecting n nodes.
Evaluate every possible root choice and return the smallest reversal count.

What This Tests

Common Patterns

Graph TraversalDFS/BFSDynamic Programming

Hint 1

Hint 2

What Interviewers May Ask Next

Report seen similar question in interview

python

Test Cases

Input

Output

Expected