Divide Nodes Into the Maximum Number of Groups

Statement

You are given an undirected graph with n vertices labeled from $1$ to n, and an edge list edges where each edges[i] connects two distinct vertices.

You want to partition all vertices into an ordered sequence of non empty groups, numbered from ...