We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 99cb8b4 commit e81f4dcCopy full SHA for e81f4dc
Python/prime-arrangements.py
@@ -1,4 +1,4 @@
1
-# Time: O(n)
+# Time: O(n/2 + n/3 + ... + n/p) = O(nlog(logn)), see https://mathoverflow.net/questions/4596/on-the-series-1-2-1-3-1-5-1-7-1-11
2
# Space: O(n)
3
4
class Solution(object):
0 commit comments