How should I practice Earliest Full Connectivity with Edge Removals?

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

Is Earliest Full Connectivity with Edge Removals associated with Google?

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

Earliest Full Connectivity with Edge Removals

Google● HardFULLTIMEONSITE INTERVIEW

Problem statement

Process chronological logs [timestamp, operation, u, v] for an undirected social graph. Operation is ADD or REMOVE. All logs with the same timestamp take effect atomically.

The problem statement continues

Pro

Examples

Example 1

n = 4logs = [["1","ADD","0","1"],["2","ADD","2","3"],["3","ADD","1","2"]]return = 3

All four users first connect at timestamp 3.

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

See Google hiring insights