Gamified challenge · Adjacency matrix
friends is an n × n grid: friends[i][j] = 1 when persons i and j are friends, else 0. It is symmetric, and everyone is their own friend (friends[i][i] = 1).
Friendship spreads: friends of friends of friends all belong to the same province. Write provinces(friends) that returns how many provinces the town has. An empty town (n = 0) has 0.
Example: [[1, 1, 0], [1, 1, 0], [0, 0, 1]] → 2: persons 0 and 1 form one province, person 2 is alone in another.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google