Topological Sort - Largest Color Value in a Directed Graph
Given a directed graph with node colors
"bccab" and edges [[0,1],[1,2],[0,3],[3,4]], what is the maximum count of any single color along any path using the topological sort + DP approach?