Count Equal and Divisible Pairs in an Array LeetCode solution in JavaScript

1
/**
2
 * @param {number[]} nums
3
 * @param {number} k
4
 * @return {number}
5
 */
6
var countPairs = function (nums, k) {
7
  var count = 0;
8
  for (let i = 0; i < nums.length; i++) {
9
    for (let j = i + 1; j < nums.length; j++) {
10
      if (nums[i] == nums[j] && (i * j) % k == 0) {
11
        count++;
12
      }
13
    }
14
  }
15
  return count;
16
};