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

Paper- Saejin #53

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

Paper- Saejin #53

wants to merge 2 commits into from

Conversation

saebaebae
Copy link

Hash Table Practice

Congratulations! You're submitting your assignment!

Comprehension Questions

Question Answer
Why is a good Hash Function Important? bc it's fast! time complexity of O1 for searching/adding/removing
How can you judge if a hash function is good or not? values are consistent, map different keys to different values, execute in constant time, hashing should appear random.
Is there a perfect hash function? If so what is it? No.
Describe a strategy to handle collisions in a hash table One strategy is double hashing where a secondary hash function is used when a collision occurs
Describe a situation where a hash table wouldn't be as useful as a binary search tree if a dataset can't produce unique key values
What is one thing that is more clear to you on hash tables now how to handle collisions

CheezItMan
CheezItMan reviewed Jan 28, 2022
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.

Well done Saejin, you hit the learning goals here. Well done.

hash_practice/exercises.py
Comment on lines 2 to 7
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: On
Space Complexity: On
"""
Copy link

Choose a reason for hiding this comment

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

👍

hash_practice/exercises.py
Comment on lines 27 to +31
def top_k_frequent_elements(nums, k):
""" This method will return the k most common elements
In the case of a tie it will select the first occuring element.
Time Complexity: ?
Space Complexity: ?
Time Complexity: Onk
Space Complexity: On
Copy link

Choose a reason for hiding this comment

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

👍

hash_practice/exercises.py

return result




def valid_sudoku(table):
Copy link

Choose a reason for hiding this comment

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

👍 Correct!

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
@saebaebae @CheezItMan