Leetcode 1466. Reorder Routes to Make All Paths Lead to the City Zero
Given a tree of n nodes with one-way roads, compute the minimum number of edge reversals needed so that every city can reach city 0 — essentially reorient the fewest directed edges in a tree so all paths lead to the root.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.