Topological Sort - Largest Color Value in a Directed Graph
Consider a graph with a single node colored 'z' and no edges. What does the optimal topological sort + DP solution return as the largest color value?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All Questions