# Friend Circles / Number of Provinces pattern (LeetCode 547) Union-Find or DFS count connected components in adjacency matrix. ```python def findCircleNum(isConnected): n=len(isConnected); seen=[False]*n def dfs(i): seen[i]=True for j in range(n): if isConnected[i][j] and not seen[j]: dfs(j) ans=0 for i in range(n): if not seen[i]: dfs(i); ans+=1 return ans ``` Practice with [Linkjob AI](https://www.linkjob.ai/). (Affiliation: I work on Linkjob AI.)
Save
ctrl + s
New
ctrl + n
Duplicate
ctrl + d
Raw
ctrl + shift + r
Github
Support this project
markdown
7