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.

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

Kayla Pine #59

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Kayla Pine #59

wants to merge 1 commit into from

Conversation

khuddleup
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

@kyra-patton kyra-patton 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, Kayla. I left some comments on time and space complexity. See Github for details.

🟢

@@ -2,18 +2,46 @@
def grouped_anagrams(strings):
""" 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(n^2)? The fucntion only loops through the length of strings for

Choose a reason for hiding this comment

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

⏱ Sorting is an O(n) operation, however if we assume all strings are valid english words, we can say this is an O(1) operation because n will never be very large.

Therefore you just have the for loop through the elements of strings which would make this O(n)

Space Complexity: ?
Time Complexity: O(n^2)? The fucntion only loops through the length of strings for
the number of letters in each string?
Space Complexity: O(n)? Theres only 2 varaibles being stored...sortedWord and anagramsHash?

Choose a reason for hiding this comment

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

🪐 Yes! anagramsHash can have at most n elements where n is the length of strings. Overall the combined length of the values will also be n elements.

Time Complexity: ?
Space Complexity: ?
Time Complexity: O(n)
Space Complexity: O(n^2)?

Choose a reason for hiding this comment

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

Space complexity would be O(n). finalList will be of length k which can never be greater than the length of nums. freqHash will have at most n key value pairs as well, where the values are all integers.

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