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).