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 bc5f114 commit a889ab8Copy full SHA for a889ab8
group-anagrams/dusunax.py
@@ -16,11 +16,12 @@
16
- using a hash map to store the sorted strings. = O(N * K)
17
'''
18
class Solution:
19
- def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
20
- result = defaultdict(list)
21
-
22
- for str in strs: # TC: O(N)
23
- sorted_key = ''.join(sorted(str)) # sorting 👉 TC: O(K * Log(K))
24
- result[sorted_key].append(str) # TC: O(1) on average
25
26
- return list(result.values())
+ def groupAnagrams(self, strs: List[str]) -> List[List[str]]:
+ result = defaultdict(list)
+
+ for str in strs: # TC: O(N)
+ sorted_key = ''.join(sorted(str)) # sorting 👉 TC: O(K * Log(K))
+ result[sorted_key].append(str) # TC: O(1) on average
+ return list(result.values())
27
0 commit comments