Space - Jessica #36

seaweeddol · 2020-10-17T23:34:34Z

Hash Table Practice

Congratulations! You're submitting your assignment!

Question	Answer
Why is a good Hash Function Important?	Hash functions can perform searches quickly
How can you judge if a hash function is good or not?	A good hash function should be consistent and map different keys to different values.
Is there a perfect hash function? If so what is it?	No
Describe a strategy to handle collisions in a hash table	One way is to use a linked list (chaining). Even if there is a collision, linked lists are quick to insert and remove items as long as there aren't too many elements.
Describe a situation where a hash table wouldn't be as useful as a binary search tree	If you cannot provide unique key values then a hash table is not the best choice.
What is one thing that is more clear to you on hash tables now	Different methods of collision handling

CheezItMan

Well done Jessica, you hit the learning goals here Nice work.

CheezItMan · 2020-12-09T17:32:22Z

lib/exercises.rb

+# Time Complexity: O(n)
+# Space Complexity: O(n)
+
+# hash function that assigns each letter a value
+def alphabet_keys()


Nice helper!

CheezItMan · 2020-12-09T17:32:31Z

lib/exercises.rb

+  end
+
+  return alphabet_keys
+end

 def grouped_anagrams(strings)


CheezItMan · 2020-12-09T17:32:47Z

lib/exercises.rb

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


seaweeddol added 3 commits September 13, 2020 21:23

implement grouped_anagrams method

492a382

implement top_k_frequent_elements

9d26131

add space and time complexity

eb2d956

CheezItMan reviewed Dec 9, 2020

View reviewed changes