Search⌘ K

DIY: Number of Provinces

Understand how to analyze a connectivity matrix to determine groups of connected cities called provinces. Learn to implement a function that counts these provinces by exploring direct and indirect city connections, preparing you for related coding interview problems.

Problem statement

Suppose there are n cities, where some are connected, while others are not. If a city c1 is connected to city c2, and city c2 is connected to city c3, then c1 is indirectly connected to c3.

A group of directly or indirectly connected cities, where no other city is part of this group, is called a province.

You are given a matrix, isConnected with a size of n x n. An entry isConnected[i][j] = 1 if the ...