Count The Number Of Complete Components · Interview Problem

Back to problems

Leetcode

count-the-number-of-complete-components

Medium

Graphs

Union Find

Breadth-First Search

Depth-First Search

Count The Number Of Complete Components

Given an undirected graph, count the number of complete connected components.

Acceptance 100%

Start Practice

Problem Statement

Core description from the backend problem record.

Description

You are given an undirected graph with n nodes labeled from 0 to n - 1 and an edge list edges where edges[i] = [ai, bi] indicates that there is an edge between nodes ai and bi in the graph. A connected component of a graph is complete if there is an edge between every pair of distinct nodes in the component. Return the number of complete connected components in the graph.

Input Format

An integer n representing the number of nodes.
A list edges where each element is a list of two integers representing an undirected edge between two nodes.

Output Format

Return an integer representing the number of complete connected components in the graph.

Constraints

1 <= n <= 50
0 <= edges.length <= n * (n - 1) / 2
edges[i].length == 2
0 <= ai, bi < n
ai != bi
There are no repeated edges.

Loading Preptin

Description

Input Format

Output Format

Constraints