-
Notifications
You must be signed in to change notification settings - Fork 39
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Earth | Ana #29
base: master
Are you sure you want to change the base?
Earth | Ana #29
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nice work Ana! I had some feedback on time complexity, but otherwise great work. Let me know if you have questions on my feedback.
# Time Complexity: o(n) | ||
# Space Complexity: o(n) | ||
|
||
def grouped_anagrams(strings) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 The time complexity is O(n) if the strings are limited in size, but O(n * m log m) where m is the length of the strings, if the strings aren't limited in size.
# Time Complexity: o(n) | ||
# Space Complexity: o(n) | ||
def top_k_frequent_elements(list, k) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 However, because you're sorting the time complexity is O(n log n).
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions