Time - Sharon

[sharonkeikei]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	A hash table has unique key which makes look up very efficient.
How can you judge if a hash function is good or not?	By looking at the hash table time complexity and how often and how easy to have collision and its collision solutions.
Is there a perfect hash function? If so what is it?	The one that doesn't have any collision.
Describe a strategy to handle collisions in a hash table	Chaining : A strategy to handle collisions where each element of a hash table's internal array serves as the head of a linked list. This allows the same bucket to store multiple items
Describe a situation where a hash table wouldn't be as useful as a binary search tree	When the order matters.
What is one thing that is more clear to you on hash tables now	The concept of collisions and the strategies

[CheezItMan]

Not bad Sharon, take a look at my comments and let me know what questions you have. I do think you have a mistake in the top_k_most_frequent method.

[CheezItMan]

better name for this variable would be chars

[CheezItMan]

👍 , but the time complexity for your solution is O(n)

[CheezItMan]

How do you know the keys will be sorted by most-frequent to least-frequent. I'm not sure this actually works.