LeetCode 547 Number of Provinces - Problem Statement

Problem: Number of Provinces Task: Given the connection matrix of $n$ cities, count connected components. This is DSU's bread and butter. Process all connections, union connected cities, and count how many distinct leaders remain.

Alternatively, start with count = $n$ and decrement on each successful union. The input is an adjacency matrix, so you check isConnected[i][j] for all pairs. Only process pairs where $i < j$ to avoid duplicate unions.