Liv - Space

[mulhoo]

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question	Answer
Why is a good Hash Function Important?	When it's "ideal" it has a time complexity of O1 for insert/delete/search. Makes it faster than a lot of other structures.
How can you judge if a hash function is good or not?	if the hash values are uniformly distributed, close keys have far apart values, hashing appears to be random
Is there a perfect hash function? If so what is it?	Yes, where there is one-to-one mapping from each key to a unique integer value
Describe a strategy to handle collisions in a hash table	Separate chaining - using a linked list to store the collided keys, but uses additional memory
Describe a situation where a hash table wouldn't be as useful as a binary search tree	Anywhere you need to find ordered data.
What is one thing that is more clear to you on hash tables now	Why they are the best choice for certain scenarios

[CheezItMan]

I like your solution for the Anagram problem, the solution for the k most frequent elements isn't quite working, but think about making a hash where the keys are the elements and the values are their frequencies. That might get you started here.

[CheezItMan]

Clever, I like the use of a subhash as a key.

[CheezItMan]

Not quite working as it fails for [3, 3, 3, 3, 3, 1, 1, 2, 2, 2]