Max Graph

Given an array $A$ of size $N$, construct a simple (i.e, without self-loops and multiedges) **strongly connected directed graph** with $N$ nodes where $A_i$ denotes the colour of $i^{th}$ node. The graph should satisfy the following properties: - If $A_i = A_j$, then nodes $i$ and $j$ should have the same outdegree. - If $A_i = A_j$, neither of the edges $i \to j$ and $j \to i$ should exist. - If