You are given an array of unique positive integers nums and a positive integer threshold.

Consider an undirected graph where each element of nums represents a node. There is an edge between two distinct nodes nums[i] and nums[j] if and only if $ ext{lcm}(nums[i], nums[j]) \le$ threshold, where $ ext{lcm}(x, y)$ denotes the least common multiple of $x$ and $y$.

Return the total number of connected components in this graph.

Constraints:

• $1 \le$ nums.length $\le 10^5$

• $1 \le$ nums[i] $\le 10^9$

• All elements of nums are unique.

• $1 \le$ threshold $\le 2 imes 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.