Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Compute infection spread time
Coding · Grids & Matrices · Stacks & Queues
- Find Minimum Time to Finish All Jobs
Coding
- Find Minimum Time to Finish All Jobs II
Coding
- Find Minimum Time to Reach Last Room I
Coding
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 1956. Minimum Time For K Virus Variants to Spread
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source