Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2685. Count the Number of Complete Components
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source