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

Water - Kareha #11

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

Water - Kareha #11

wants to merge 3 commits into from

Conversation

agesak
Copy link

@agesak agesak commented Apr 19, 2021

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? To avoid collisions and lookups that approach O(n) time
How can you judge if a hash function is good or not? Good hash function: 1. Fast computation 2. Uniformly distributes values 3. Hashing is random
Is there a perfect hash function? If so what is it? No
Describe a strategy to handle collisions in a hash table Linear probing, where you linearly search for the next open spot in the array to input the key/value pair
Describe a situation where a hash table wouldn't be as useful as a binary search tree When sorting matters
What is one thing that is more clear to you on hash tables now How hash functions work

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 Kareha, you hit the learning goals here and got the Sudoku solution as well. Well done!

Comment on lines +4 to 7
# Time Complexity: O(n) * O(mlogm)
# Space Complexity: O(n+m) = O(n)

def grouped_anagrams(strings)

Choose a reason for hiding this comment

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

👍 We normally write the time complexity O(n + m log m)

Comment on lines +19 to 21
# Time Complexity: O(nlogn)
# 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.

👍

end

def matrix_helper(matrix, i, j)

Choose a reason for hiding this comment

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

I like the helper function here.

Comment on lines +46 to 48
# Time Complexity: O(n^2) - where n and n are rows and cols
# Space Complexity: O(n) - bc hash table created for every row/col separately
def valid_sudoku(table)

Choose a reason for hiding this comment

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

👍 Nice work

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