Dynamic Friendship Connectivity
Google● HardNEW GRADINTERNONSITE INTERVIEWProblem statement
There are n servers numbered from 0 through n - 1. Their undirected connection multigraph is initially empty. Process operations in order:
The problem statement continues
ProExamples
Example 1
n = 4operations = [[0,0,1],[0,1,2],[2,0,2],[1,1,2],[2,0,2]]return = [true,false]The first two connections link servers 0 and 2. Removing {1,2} breaks that path before the second query.
FastPrep Pro
Reported in 1 Google interview this weekUnlock 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