Leetcode 2995. Viewers Turned Streamers

Given a network where each viewer converts to a streamer once a certain number of their neighbors are streaming, determine the minimal initial seed set (or the time/steps) needed to cause a target/all users to convert. This is a threshold-cascade/influence‑maximization problem on graphs that requires modeling propagation and typically uses BFS/topological traversal, greedy/priority-queue heuristics, or combinatorial search for exact solutions.