Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Myriam #9

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Myriam #9

wants to merge 2 commits into from

Conversation

MyriamWD
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? A good hash function prevents collisions
How can you judge if a hash function is good or not? By the amount of collisions and the distribution of the indexes
Is there a perfect hash function? If so what is it? There is not a perfect hash function
Describe a strategy to handle collisions in a hash table Quadratic probing - when two keys point to the same index the latest key will be recalculated using an algorithm or formula to find a new bucket
Describe a situation where a hash table wouldn't be as useful as a binary search tree When there is need to keep values in order
What is one thing that is more clear to you on hash tables now different techniques for collisions handling

@MyriamWD MyriamWD changed the title grouped anagrams - top k frequent elements Myriam Sep 16, 2019
CheezItMan
CheezItMan reviewed Sep 18, 2019
View reviewed changes
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 both on the grouped_anagrams, and top_k_frequent_elements. Well done.

lib/exercises.rb
@@ -2,19 +2,73 @@

# This method will return an array of arrays.
# Each subarray will have strings which are anagrams of each other
# Time Complexity: ?
# Space Complexity: ?
# Time Complexity: O(m*n log n), where m is each of the items on strings and n is the amount of characters on each string
Copy link

Choose a reason for hiding this comment

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

👍

lib/exercises.rb
end

return groups.values

end

# This method will return the k most common elements
# in the case of a tie it will select the first occuring element.
# Time Complexity: ?
Copy link

Choose a reason for hiding this comment

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

No answer on time & space complexity?

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

@CheezItMan CheezItMan CheezItMan left review comments

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@MyriamWD @CheezItMan