Solution: Loud and Rich
Let’s solve the Loud and Rich problem using the Topological Sort pattern.
We'll cover the following...
We'll cover the following...
Statement
You’re given a group of individuals where everyone has a specific amount of money and a different level of quietness. Additionally, you’re given an array richer = quiet.
Return an integer array res, where res[i] = y. If y has the lowest value in quiet[y] among all individuals, who have equal or more money than the individual i.
Constraints:
...