The Earliest Moment When Everyone Become Friends: coding question

Available question text

Given timestamped friendship events among N people, determine the earliest time when the social graph becomes fully connected; process events in chronological order and use a union-find (DSU) to merge components, returning the timestamp when the component count becomes one or -1 if it never does.

Continue with questions that share topics or the same question type.

Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Make Lexicographically Smallest Array by Swapping Elements
Coding · Array · Sorting · Union-Find
Maximum Number of Points From Grid Queries
Coding · Array · Breadth-First Search · Heap (Priority Queue)
Number of Distinct Islands
Coding · Array · Breadth-First Search · Depth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 3 records

Amazon
Leetcode 1101. The Earliest Moment When Everyone Become Friends
Reported Aug 10, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Google
Leetcode 1101. The Earliest Moment When Everyone Become Friends
Reported Sep 26, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
Uber
Leetcode 1101. The Earliest Moment When Everyone Become Friends
Reported Mar 25, 2026 · 2 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 1 record

Uber

The Earliest Moment When Everyone Become Friends

Available question text

Related questions

The Earliest Moment When Everyone Become Friends

Available question text

Related questions