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

KS #23

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

KS #23

wants to merge 1 commit into from

Conversation

goblineer
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

@goblineer goblineer changed the title Solve for hash practice KS Oct 17, 2019
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.

Thanks for turning in this PR Kate. Both methods work well are are efficient. Do take a look at my comments and consider adding the space/time complexities as well. Otherwise outstanding work.

# Each subarray will have strings which are anagrams of each other
# Time Complexity: ?
# Space Complexity: ?

def grouped_anagrams(strings)

Choose a reason for hiding this comment

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

👍 Space & Time Complexity?

deltas[max].each do |num|
solution << num
remains -= 1
break if remains == 0

Choose a reason for hiding this comment

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

You don't need this break since your while loop runs while remains > 0

break if remains == 0
end
end
max -= 1

Choose a reason for hiding this comment

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

indentation?

# 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: ?
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.

👍

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