Time - Yesenia #33

yesentorres · 2020-09-30T21:50:01Z

Hash Table Practice

Congratulations! You're submitting your assignment!

Question	Answer
Why is a good Hash Function Important?	A good hash function is important so that it doesn't cause too many collisions, which would reduce the efficiency of a Hash Table.
How can you judge if a hash function is good or not?	Depending on how many collisions it causes.
Is there a perfect hash function? If so what is it?	There is not, hash functions cannot guarantee no collisions.
Describe a strategy to handle collisions in a hash table	Employ a hashing function that utilizes the division method to assign the keys.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	A BST would be preferred when a dataset cannot provide unique key values.
What is one thing that is more clear to you on hash tables now	I am have more clarity on how hash tables compare to other ADTs.

CheezItMan

Well done Yesenia, these both work and hit the learning goals here. Nice work!

CheezItMan · 2020-10-01T18:34:33Z

lib/exercises.rb

-# Time Complexity: ?
-# Space Complexity: ?
+# Time Complexity: O(n)
+# Space Complexity: O(n)

 def grouped_anagrams(strings)


CheezItMan · 2020-10-01T18:35:33Z

lib/exercises.rb

+# Time Complexity: O(n)
+# Space Complexity: O(n)
 def top_k_frequent_elements(list, k)


👍 , Nice

passing tests

a614a1f

CheezItMan reviewed Oct 1, 2020

View reviewed changes