Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2995. Viewers Turned Streamers
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source