Minimum Edge Reversals So Every Node Is Reachable: coding question

Available question text

Given a directed graph whose underlying undirected graph is a tree, compute for every node the minimum number of edge reversals required so that starting from that node you can reach all other nodes. This reduces to a tree shortest-path / rerooting problem by treating each original edge as cost 0 in its given direction and cost 1 if reversed, solvable with a 0-1 BFS or tree DP + rerooting to obtain answers for all nodes.

Continue with questions that share topics or the same question type.

Cheapest Flights Within K Stops
Coding · Breadth-First Search · Depth-First Search · Dynamic Programming
Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
Course Schedule II
Coding · Breadth-First Search · Depth-First Search · Graph Theory

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Microsoft
Leetcode 2858. Minimum Edge Reversals So Every Node Is Reachable
Reported Jun 26, 2026 · 6 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Salesforce
Minimum Edge Reversals So Every Node Is Reachable
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 64.9. This is not an interview probability.
View source
Uber
Minimum Edge Reversals So Every Node Is Reachable
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 88.6. This is not an interview probability.
View source

Available question text

Minimum Edge Reversals So Every Node Is Reachable

Available question text

Related questions

Minimum Edge Reversals So Every Node Is Reachable

Available question text

Related questions