Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.