Leetcode 2685. Count the Number of Complete Components

Given an undirected graph with n vertices, count how many connected components are complete graphs (cliques). For each connected component of size k, check that it contains exactly k*(k-1)/2 edges (equivalently every vertex in the component has degree k-1).