We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 6cd3b62 commit 35e71f2Copy full SHA for 35e71f2
Python/count-equal-and-divisible-pairs-in-an-array.py
@@ -1,4 +1,4 @@
1
-# Time: O(n * sqrt(k))
+# Time: O(nlogk + n * sqrt(k))
2
# Space: O(n + sqrt(k)), number of factors of k is at most sqrt(k)
3
4
import collections
0 commit comments