Skip to content

Conversation

@seattlefurby17
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important?
How can you judge if a hash function is good or not?
Is there a perfect hash function? If so what is it?
Describe a strategy to handle collisions in a hash table
Describe a situation where a hash table wouldn't be as useful as a binary search tree
What is one thing that is more clear to you on hash tables now

Copy link

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

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

Comment on lines +3 to 7
# Time Complexity: O(n*mlog(m)) where n is the number of words and m is
# is the size of the longest word in string O(mlogm) is the result of the sorting
# Space Complexity: n * m (worst case has to create a new array/key for each string and takes m space to sort it)

def grouped_anagrams(strings)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment on lines +39 to 44
# Build a requency hash table, sort by most to least
# Return only the nums = k
# Time Complexity: O(n) to build the frequency table, O(nlogn) to sort the frequency table
# Space Complexity: O(n)

def top_k_frequent_elements(list, k)

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍 , you are sorting so that affects the time complexity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants