Earth - Kal

[kashenafi]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Minimizes collisions which keeps the look-up time short.
How can you judge if a hash function is good or not?	It should be consistent, map different keys to different values, execute in O(1) time, appear random.
Is there a perfect hash function? If so what is it?	No--any hash function could create collisions. The hope is to minimize them.
Describe a strategy to handle collisions in a hash table	Chaining: storing multiple elements in a single bucket as a linked list.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	When you need to keep elements sorted.
What is one thing that is more clear to you on hash tables now	I can explain more ways of dealing with collisions.

[CheezItMan]

Nice work Kal, you did hit the main learning goals here, although no time/space prediction for top_k_frequent_elements.

[CheezItMan]

👍

[CheezItMan]

👍 No guesses on time/space complexity?