CodingReported in a candidate post, Aug 2025
Minimum time until components become connected (modified)
Filed under Meesho
The question
A slightly modified version of the LeetCode problem 'Minimum Time for K Connected Components': find the minimum time at which all components of a graph (up to 1e5 nodes) become connected.
No write-up yet. Related questions below have one.
Related Meesho questions
Collected from public candidate posts and coding forums. Updated Nov 2026.