-
Notifications
You must be signed in to change notification settings - Fork 6
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
base: master
Are you sure you want to change the base?
Conversation
There was a problem hiding this 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.
// 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) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
// 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) { |
There was a problem hiding this comment.
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) { |
There was a problem hiding this comment.
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.
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions