Runtime: 15 ms (Top 5.12%) | Memory: 43.6 MB (Top 19.49%)

Author: AnasImloul

scripts/algorithms/C/Count Equal and Divisible Pairs in an Array/Count Equal and Divisible Pairs in an Array.java

@@ -0,0 +1,22 @@
+// Runtime: 15 ms (Top 5.12%) | Memory: 43.6 MB (Top 19.49%)
+class Solution {
+    public int countPairs(int[] nums, int k) {
+      HashMap<Integer,List<Integer>> hMap = new HashMap<>();
+        int count = 0;
+        for(int i = 0 ; i < nums.length ; i++){
+            if(!hMap.containsKey(nums[i])){
+                List<Integer> l = new ArrayList<>();
+                l.add(i);
+                hMap.put(nums[i],l);
+            }else{
+                List<Integer> v = hMap.get(nums[i]);
+                for(Integer j : v){
+                    if((i*j)%k == 0) count++;
+                }
+                v.add(i);
+                hMap.put(nums[i],v);
+            }
+        }
+        return count;
+    }
+}