You are given an undirected graph as a list of edges. Each node is labeled from 1 to n. You are asked to find the connected components in the graph. For each connected component, find the number of nodes in it. Return the sum of the squares of the sizes of the connected components.

Question

Accepted Answer

Connected sum problem involves finding the number of connected components in a graph

The problem can be solved using DFS or BFS algorithm
The input graph can be represented using adjacency list or matrix
The output is the number of connected components in the graph