How should I practice Earliest Time of Full Connection?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Earliest Time of Full Connection associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · Union Find

Earliest Time of Full Connection

● Medium

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

There are n nodes numbered from 0 to n - 1. Each row [time, u, v] in events records that an undirected connection between nodes u and v becomes available at time.

Connections never disappear. Determine the earliest timestamp at which every node belongs to one connected component. Events may be given in any order, and multiple events may share a timestamp.

The problem statement continues

Pro

Examples

Example 1

n = 4events = [[5,0,1],[2,2,3],[8,1,2]]return = 8

At time 5, the components are {0,1} and {2,3}. The event at time 8 joins them, so 8 is the first fully connected time.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
2 more worked examples, explained
Guided hints and editorial
Run your code on real test cases

$8.25/month

$99 billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week