# Loud And Rich: Practice Notes

Loud And Rich shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

DFS/memo on the richer-than graph: the quietest person in a node's reachable set, cached so each subtree is solved once.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n+e).

## Common mistake

Recomputing the reachable set from scratch for every query node.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.