Loud and Rich: coding question

Available question text

Given an acyclic directed graph of richer->poorer relations and a quietness score per person, compute for each person the quietest person among all people who are definitely at least as rich (i.e., all ancestors in the richer graph). This is a reachability/min-propagation problem on a DAG, typically solved by DFS with memoization or topological DP to propagate the minimum-quiet index.

Continue with questions that share topics or the same question type.

Alien Dictionary
Coding · Array · Breadth-First Search · Depth-First Search
Course Schedule
Coding · Breadth-First Search · Depth-First Search · Directed Acyclic Graph
Find All Possible Recipes from Given Supplies
Coding · Array · Directed Acyclic Graph · Graph Theory
Parallel Courses III
Coding · Array · Directed Acyclic Graph · Dynamic Programming

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 851. Loud and Rich
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 2 records

Flipkart
Loud and Rich
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 74. This is not an interview probability.
View source
Flipkart
Loud and Rich
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 55.4. This is not an interview probability.
View source

Available question text

Loud and Rich

Available question text

Related questions

Loud and Rich

Available question text

Related questions