1p3a_oj
Question
Earliest Time When Everyone Becomes Friends (Union-Find / Graph) + Support Unfriend
Question Details
Problem You have n people labeled 0..n-1 and a stream of time-stamped social events. Part 1 (Basic) Each event is (t, a, b) meaning that at time t, a and b become friends. Return
Full Details
🔒
Unlock all Google questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a google interview for a swe role during the coding round.
It covers the following topics: Graphs, Union Find, Graph .
Difficulty rating: Easy
Topics
More Google Interview Questions
Reddit
7 months in Google Team Matching
Reddit
Google L4 SWE prep
Reddit
Google team matching new grad 2026 - US
Reddit
I got offers from Google, Meta, Amazon (SWE intern) by GRINDING for exactly ONE year which made technical interviews for big tech TRIVIAL (rant)
Reddit
Google L4 India - Accepted | Compensation and Preparation