Largest Color Value in a Directed Graph

Problem Statement:- There is a directed graph of n colored nodes and m edges. The nodes are numbered from 0 to n - 1. You are given a string colors where colors[i] is a lowercase English letter representing the color of the i^th node in thi...