-
Notifications
You must be signed in to change notification settings - Fork 39
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
base: master
Are you sure you want to change the base?
Water - Kareha #11
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.
Nice work Kareha, you hit the learning goals here and got the Sudoku solution as well. Well done!
# Time Complexity: O(n) * O(mlogm) | ||
# Space Complexity: O(n+m) = O(n) | ||
|
||
def 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.
👍 We normally write the time complexity O(n + m log m)
# Time Complexity: O(nlogn) | ||
# Space Complexity: O(n) | ||
def 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.
👍
end | ||
|
||
def matrix_helper(matrix, i, j) |
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.
I like the helper function here.
# 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) |
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.
👍 Nice work
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions