Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet. Beauty of a path is defined as the number of most frequently occurring alphabet. Find the most...

Given a directed graph with N nodes and M edges. Each node is associated with lowercase english alphabet.

Beauty of a path is defined as the number of most frequently occurring alphabet.

Find the most beautiful path and return the maximum beauty value it has.