Skip to content

Conversation

@steve-messing
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? They are useful and time-efficient data structures
How can you judge if a hash function is good or not? Minimal collisions and good time complexity
Is there a perfect hash function? If so what is it? No, there is no such thing as a perfect hash function.
Describe a strategy to handle collisions in a hash table Chaining the collisions with a linked list would be one solution.
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 Sophie, this hits the main learning goals, but I encourage you to look at the Big O considerations as well.

# Time Complexity: ?
# Space Complexity: ?

def grouped_anagrams(strings)

Choose a reason for hiding this comment

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

Space & Time complexity?

Comment on lines 13 to 17
# This method will return the k most common elements
# in the case of a tie it will select the first occuring element.
# Time Complexity: ?
# Space Complexity: ?
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.

👍 Space & time complexity?

@steve-messing steve-messing changed the title tests passing Earth - Sophie Apr 30, 2021
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