Constraints:

• $n =$ quiet.length
• $1 \leq$ $n$ $\leq 500$
• $0 \leq$ quiet[i] $<$ $n$
• All the values of quiet are unique.
• $0 \leq$ richer.length $\leq n * (n - 1) / 2$
• $0 \leq$ x[i], y[i] $<$ n
• $x_{i}$ $!=$ $y_{i}$
• All the pairs of richer are unique.
• The observations in richer are all logically consistent.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Implement your solution in the following coding playground: