Given a $0$ indexed integer array nums and an integer k, determine the total number of index pairs (i, j) satisfying $0 \leq$ i $<$ j $<$ nums.length such that nums[i] == nums[j] and (i $\cdot$ j) is divisible by k.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i], k $\leq 100$

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.