1. topological sort on a DAG (kahns, in-degree queue) - 15 min 2. BFS shortest path b/w 2 nodes - 10 min 2 problems in one round. tight but doable

Loading...

Something went wrong while trying to load the full version of this site. Try hard-refreshing this page to fix the error.

Snap SWE may - topo sort + BFS

1.