Largest Connected City Network | Dataford Interview Questions

Given a network of cities and connected roads, find the size of the largest connected group of cities (with custom constraints).

Asked in the Round 2: DSA stage. Focus on DSU Data Structure & Connected Components.

Implement largest_connected_group(n, roads), where cities are labeled 0 through n - 1 and each road is a pair [u, v]. Return the number of cities in the largest connected component. Roads may be duplicated or connect a city to itself.

Constraints

1 <= n <= 10^5
0 <= len(roads) <= 2 * 10^5
Each road has exactly two endpoints
Each endpoint is an integer in [0, n - 1]
Duplicate roads and self-loops are allowed

Function Signature

def largest_connected_group(n, roads):

Your question is Largest Connected City Network. 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

Given a network of cities and connected roads, find the size of the largest connected group of cities (with custom constraints).

Asked in the Round 2: DSA stage. Focus on DSU Data Structure & Connected Components.

Constraints

1 <= n <= 10^5
0 <= len(roads) <= 2 * 10^5
Each road has exactly two endpoints
Each endpoint is an integer in [0, n - 1]
Duplicate roads and self-loops are allowed

Function Signature

def largest_connected_group(n, roads):

Your question is Largest Connected City Network. 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.