Tap here to switch tabs
Problem
Submissions

Problem: Loud and Rich

Loud and Rich gives each person a quietness level and richer-than relationships. Return an array naming, for every person, the quietest individual who has at least as much money.

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 = [xi,yi​][x_{i}, y_{i}​], so that xix_{i}​ has more money than yiy_{i}​. The quietness level of each individual is represented using an array named 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:

  • n=n = quiet.length
  • 1≤1 \leq nn ≤500\leq 500
  • 0≤0 \leq quiet[i] << nn
  • All the values of quiet are unique.
  • 0≤0 \leq richer.length ≤n∗(n−1)/2\leq n * (n - 1) / 2
  • 0≤0 \leq x[i], y[i] << n
  • xix_{i} !=!= yiy_{i}
  • All the pairs of richer are unique.
  • The observations in richer are all logically consistent.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Loud and Rich

Loud and Rich gives each person a quietness level and richer-than relationships. Return an array naming, for every person, the quietest individual who has at least as much money.

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 = [xi,yi​][x_{i}, y_{i}​], so that xix_{i}​ has more money than yiy_{i}​. The quietness level of each individual is represented using an array named 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:

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