Earliest Full Connectivity | Dataford Interview Questions

Given a log of lines ' A became friend to B', return the earliest timestamp at which everyone is connected (friends transitively).

Asked in the Coding round 1 stage. Implement earliest_connected_timestamp(logs). Each log line is a string such as "12 Alice became friend to Bob"; timestamps are integers, and the log may not be ordered. Consider every person appearing in the logs. Return -1 if all people never become connected.

Examples: ['1 A became friend to B', '3 B became friend to C'] returns 3; ['5 A became friend to B', '2 B became friend to C'] returns 5 after timestamp ordering.

Constraints: There can be zero or more lines, each line has the stated format, and the two people on a line are distinct.

Constraints

0 <= len(logs) <= 10^5
Each line has the format '<integer timestamp> A became friend to B'
Each timestamp fits in a signed 32-bit integer
The two people on each line are distinct
A person is identified by a nonempty token without whitespace
Return -1 when all people never become connected

Function Signature

def earliest_connected_timestamp(logs):

Your question is Earliest Full Connectivity. 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