Minimum content seed servers
You operate a content-distribution network modeled as a directed acyclic graph of n servers (0..n-1); edge [a, b] means server a can push content to server b. You want to seed content into the fewest servers so that every server eventually receives it (directly or transitively). Return the minimum number of seed servers required. The graph is guaranteed acyclic; self-loops, if present, should be ignored.
Implement
min_seed_nodes(n: int, edges: list[list[int]]) → intExamples
in
[4,[[0,1],[0,2],[2,3]]]out1What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[4,[[0,1],[0,2],[2,3]]]1not run yetsample