Rank Top-K Users by Network Reach and Flow Centrality
Asked at Mercor · Coding Questions · Difficulty: Hard · Last asked Jul 15, 2026
Given a directed graph referral network `u -> v` (`u` referred `v`). Build on your `ReferralNetwork` to implement two ranking functions returning the **top K users**.
Loading the problem…
More Mercor interview questions
- LLM Training Experience and Dataset Quality
- Build an LLM Evaluation Harness with Ollama Integration
- Check-and-Insert for a Growing Set of User IDs
- Permutation Sort and the Rank of the First Sorted Ordering
- Debug a Quadratic CSV Writer: Trailing Commas and Quoting
- Coffee Cups: Probability One Customer's Two Cups Beat the Other's