We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent aa61ae6 commit d2d0c29Copy full SHA for d2d0c29
Python/k-divisible-elements-subarrays.py
@@ -1,6 +1,9 @@
1
# Time: O(n^2)
2
# Space: O(t), t is the size of trie
3
4
+import collections
5
+
6
7
# trie
8
class Solution(object):
9
def countDistinct(self, nums, k, p):
0 commit comments