How should I practice Minimum Route Reversals to Warehouse Zero?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Myntra onsite interview problems in FastPrep.

Is Minimum Route Reversals to Warehouse Zero associated with Myntra?

FastPrep tags this as a Myntra onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Graph

Minimum Route Reversals to Warehouse Zero

Learn this problem

● Medium

MyntraINTERNONSITE INTERVIEW

Problem statement

There are n warehouses labeled from 0 to n - 1 and n - 1 directed routes. Each route [from, to] permits travel from from to to.

The routes form a tree when their directions are ignored. Reverse the fewest routes so every warehouse has a directed path to warehouse 0. Return that minimum number.

Function

minRouteReversals(n: int, routes: int[][]) → int

Examples

Example 1

n = 6routes = [[0,1],[1,3],[2,3],[4,0],[4,5]]return = 3

The routes from 0 to 1, from 1 to 3, and from 4 to 5 point away from warehouse 0 in the rooted tree and must be reversed.

Example 2

n = 3routes = [[1,0],[2,0]]return = 0

Both nonzero warehouses already have a direct route to warehouse 0.

Constraints

2 <= n <= 10^5.
routes.length == n - 1.
Every route contains two distinct labels in [0, n - 1].
The routes form one tree when directions are ignored.