Skip to content

Practice Count Connected Components in LCM Graph

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3378
LeetCode Problem

Count Connected Components in LCM Graph

Problem Statement

You are given an array of integers nums of size n and a positive integer threshold. There is a graph consisting of n nodes with the ith node having a value of nums[i]. Two nodes i and j in the graph are connected via an undirected edge if lcm(nums[i], nums[j]) <= threshold. Return the number of connected components in this graph. A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph. The term lcm(a, b) denotes the least common multiple of a and b.

Source: Count Connected Components in LCM Graph on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [2,4,8,3,9], threshold = 5
Output
4

# Example 2

Input
nums = [2,4,8,3,9,12], threshold = 10
Output
2

Constraints

1 <= nums.length <= 10^5
1 <= nums[i] <= 10^9
All elements of nums are unique.
1 <= threshold <= 2 * 10^5

Related LeetCode Problems

Practice more problems similar to Count Connected Components in LCM Graph.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.