Skip to content

Conversation

Kristinboyd
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important?
How can you judge if a hash function is good or not?
Is there a perfect hash function? If so what is it?
Describe a strategy to handle collisions in a hash table
Describe a situation where a hash table wouldn't be as useful as a binary search tree
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 Kristin, it would be good to try the time/space complexity questions asked. It's good practice for interviews. Other than that well done.

@@ -1,21 +1,77 @@

def grouped_anagrams(strings):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

return list(anagram_result.values())


def top_k_frequent_elements(nums, k):

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

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