Search⌘ K
AI Features

DIY: Number of Provinces

Explore how to identify groups of connected cities called provinces by implementing a function to analyze connectivity matrices. This lesson helps you understand graph traversal concepts applied to real-world problems, improving your ability to solve related coding interview questions.

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, is_connected with a size of n x n. An entry is_connected[i][j] = 1 if the i ...