Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3608. Minimum Time for K Connected Components
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).
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.