Fire - Noor

[hn4ever]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	Because Hash tables perform better for time complexity.
How can you judge if a hash function is good or not?	A good hash map should have unique keys, random, have less time of collisions, and run in a constant time.
Is there a perfect hash function? If so what is it?	no there is no perfect hash, there is always a chance of collisions.
Describe a strategy to handle collisions in a hash table	Chaining where each element of the hash tables is a linked list.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	When the order of the data matters
What is one thing that is more clear to you on hash tables now	Using hash tables efficiently.
.

[CheezItMan]

Well done Noor, you have hit the learning goals. I did make one comment on the time/space complexity of top_k_frequent_elements, but otherwise well done.

[CheezItMan]

👍

[CheezItMan]

👍 However because you're sorting the time complexity is O(n log n).

[hn4ever]

Thank you Chris :)