Skip to content

Conversation

@anakp07
Copy link

@anakp07 anakp07 commented May 18, 2021

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? They are useful data structures.
How can you judge if a hash function is good or not? Having an even distribution or close to it.
Is there a perfect hash function? If so what is it? no.
Describe a strategy to handle collisions in a hash table Store in linked-list chaining.
Describe a situation where a hash table wouldn't be as useful as a binary search tree They arent good if we want to search in order.
What is one thing that is more clear to you on hash tables now

Copy link

@CheezItMan CheezItMan left a 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.

Comment on lines +4 to 7
# Time Complexity: o(n)
# Space Complexity: o(n)

def grouped_anagrams(strings)

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.

Comment on lines +24 to 26
# Time Complexity: o(n)
# Space Complexity: o(n)
def top_k_frequent_elements(list, k)

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).

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants