Real-Time Feed Update Propagation | Dataford Interview Questions

Given a directed graph of mobile UI components, where u -> v means v depends on updates from u, return the order in which a change at source propagates through the graph. Visit each reachable component once, even if multiple paths lead to it.

Constraints

1 <= n <= 10^5
0 <= len(edges) <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
The graph may contain cycles
Each component should appear at most once in the output

Your question is Real-Time Feed Update Propagation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

1 <= n <= 10^5
0 <= len(edges) <= 2 * 10^5
0 <= u, v < n for every edge [u, v]
The graph may contain cycles
Each component should appear at most once in the output

Your question is Real-Time Feed Update Propagation. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.