Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 851. Loud and Rich
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.