Available question text
Given n nodes and edges labeled with the time they are removed, find the minimum t such that deleting all edges with time <= t produces at least k connected components; the component count is monotonic in t so the problem is typically solved by checking connectivity for candidate times using a union-find (or binary search over times).
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 3608. Minimum Time for K Connected Components
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source