Problem 45 of 75

Reorder Routes to Lead to City Zero

MediumNot solved yetInterview me on this
Before you code · which pattern fits?

The problem

There are n cities and n-1 directed roads connections (a tree if undirected). Reorient the minimum number of roads so every city can reach city 0. Return the minimum number of edges changed.

(6, [[0,1],[1,3],[2,3],[4,0],[4,5]]) → 3

Your solution runs against 3 unit tests, including edge and large-value cases.

Loading...

Test console · 3 unit tests

Submit your code to run it against all 3 unit tests. Results appear here.

JavaScript, TypeScript & Python run sandboxed in your browser; other languages run on the execution server. Your code is saved locally as you type.

Hint

Reference solution

Video explanation

Reorder Routes to Lead to City Zero, explainedNeetCode