links, comments added

Ikboljon Abdurasulov · Ikboljon Abdurasulov · commit 90b425599f8b · 2023-05-08T15:14:38.000+02:00
diff --git a/Python/20days_marathon/8_day/groupAnagrams.py b/Python/20days_marathon/8_day/groupAnagrams.py
@@ -1,3 +1,5 @@
+# LINK: https://leetcode.com/problems/group-anagrams/
+# COMPLEXITY: The time complexity is O(N * K * log K), and the space complexity is O(N * K), where N is the number of strings in the input list strs, and K is the maximum length of a string in strs.
 import collections
 class Solution:
     def groupAnagrams(self, strs):

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+# LINK: https://leetcode.com/problems/group-anagrams/`
	`2`	`+# COMPLEXITY: The time complexity is O(N * K * log K), and the space complexity is O(N * K), where N is the number of strings in the input list strs, and K is the maximum length of a string in strs.`
`1`	`3`	`import collections`
`2`	`4`	`class Solution:`
`3`	`5`	`def groupAnagrams(self, strs):`