2176. Count Equal and Divisible Pairs in an Array 🧑‍💻🧑‍💻|| 100% Easy java code 💻 💻...
Code\n\nclass Solution {\n    public int countPairs(int[] nums, int k) {\n        \n        int count =0;\n\n        for(int i=0; i<nums.length; i++){\n        
# Code\n```\nclass Solution {\n    public int countPairs(int[] nums, int k) {\n        \n        int count =0;\n\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]){\n                    int x = i*j;\n                    if(x%k==0){\n                        count++;\n                    }\n                }\n            }\n        }\n        return count;\n    }\n}\n```
['Java']