Number of Connected Components In An Undirected Graph
You have a graph of n nodes. You are given an integer n and an array edges where edges[i] = [ai, bi] indicates that there is an edge between ai and bi in the graph. Return the number of connected components in the graph.
Asked at 8 companies
AmazonFacebookGoogle
Hints
1.Think about what data structure fits Number of Connected Components In An Undirected Graph
2.Consider the brute force complexity and how to optimize