💚 5 line super easy Java solution, 99.63% faster 💚
Code\n\nclass Solution {\n    public int countPairs(int[] nums, int k) {\n        int count = 0;\n        for (int i = 0; i < nums.length; i++) {\n            f
# Code\n```\nclass Solution {\n    public int countPairs(int[] nums, int k) {\n        int count = 0;\n        for (int i = 0; i < nums.length; i++) {\n            for (int j = i + 1; j < nums.length; j++)\n                if (nums[i] == nums[j] && i * j % k == 0) count++;\n        }\n        return count;\n    }\n}\n```
['Array', 'Java']