Sync LeetCode submission Runtime - 23 ms (49.67%), Memory - 17.8 MB (80.50%)

Author: jimit105

2277-count-equal-and-divisible-pairs-in-an-array/solution.py

@@ -1,13 +1,17 @@
+# Approach 1: Traverse number pairs
+
+# Time: O(n^2)
+# Space: O(1)
+
 class Solution:
     def countPairs(self, nums: List[int], k: int) -> int:
         n = len(nums)
-        count = 0
-        
-        for i in range(n):
-            for j in range(i+1, n):
+        res = 0
+
+        for i in range(n - 1):
+            for j in range(i + 1, n):
                 if nums[i] == nums[j] and (i * j) % k == 0:
-                    count += 1
-                    
-        return count
-                    
+                    res += 1
+                
+        return res