Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1956. Minimum Time For K Virus Variants to Spread
Given a grid/graph with candidate infected cells and K virus variants that spread over time according to local adjacency rules (and possibly obstacles), find the minimum time required for K chosen sources/variants to infect the entire region. This requires deciding whether a proposed time is feasible (typically using multi-source reachability/coverage checks) and optimizing that time—often solved with binary search over time combined with BFS/graph-connectivity or flow-based feasibility tests.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.