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

Space- Shonda #5

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

Space- Shonda #5

wants to merge 2 commits into from

Conversation

Shonda860
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

@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.

No answers to the comprehension questions? Otherwise this is quite well done.

Comment on lines +3 to 12
// Time Complexity: O(n) n rep num of string m is length O(n mlog m)
// Space Complexity: O(n)

// Output:
// [
// ["ate", "eat", "tea"],
// ["nat", "tan"],
// ["bat"]
// ]
function grouped_anagrams(strings) {

Choose a reason for hiding this comment

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

👍

Comment on lines +52 to 56
// Time Complexity: O(n log n) where n reps number of unqine elements
// Space Complexity: O(n) where n reps number of unqine elements
// let list = [1, 1, 1, 2, 2, 3], k = 2
// Output: [1, 2]
function 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.

👍 , That works well done

// row, column or 3x3 subgrid
// Time Complexity: ?
// Time Complexity: 0(n ^ 2) n reps number of rows
// Space Complexity: ?
function valid_sudoku(table) {

Choose a reason for hiding this comment

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

This doesn't quite pass all the tests, but it looks like you're on a path toward a solution.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
2 participants