Given an integer array nums and an integer k, return the number of pairs (i, j) such that $0 \leq$ i $<$ j $<$ nums.length and the product nums[i] $ imes$ nums[j] is divisible by k.

Constraints:

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

• $1 \leq$ nums[i], k $\leq 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.