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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2995. Viewers Turned Streamers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact