Earliest Friends LeetCode | Dataford Interview Questions

Solve LeetCode 1101, The Earliest Moment When Everyone Become Friends.

Implement earliest_acq(logs, n), where each log is [timestamp, person_a, person_b]. Return the earliest timestamp at which all n people are connected through friendship relationships, or -1 if this never occurs.

Input logs may be unordered. Each person is represented by an integer from 0 to n - 1.

Constraints

2 <= n <= 100
1 <= logs.length <= 10^4
0 <= timestamp <= 10^9
0 <= person_a, person_b < n
person_a != person_b
All timestamps are distinct

Function Signature

def earliest_acq(logs, n):

Your question is Earliest Friends LeetCode. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve LeetCode 1101, The Earliest Moment When Everyone Become Friends.

Input logs may be unordered. Each person is represented by an integer from 0 to n - 1.

Constraints

2 <= n <= 100
1 <= logs.length <= 10^4
0 <= timestamp <= 10^9
0 <= person_a, person_b < n
person_a != person_b
All timestamps are distinct

Function Signature

def earliest_acq(logs, n):

Your question is Earliest Friends LeetCode. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.