Open
Conversation
CheezItMan
reviewed
May 6, 2021
CheezItMan
left a comment
There was a problem hiding this comment.
Nice work Christina. You hit the main learning goals here. I had a few comments on big O regarding the 2nd method, but otherwise this is well done. You even got the Sudoku problem. Well done.
Comment on lines
+4
to
10
| # Time Complexity: O(n * m * log m) | ||
| # where n is the number of strings in the array to iterate over, | ||
| # and m is the number of characters to sort in a string (m log m), | ||
| # Space Complexity: O(n * m) from sorting characters (m) and returning a new array (n) | ||
| # where n is the number of strings in the array | ||
| # and m is the number of characters in a string | ||
| def grouped_anagrams(strings) |
Comment on lines
+27
to
31
| # Time Complexity: O(n + m log m) where n is the number of elements in the list and | ||
| # and m is the number of unique elements to sort (m log m) | ||
| # Space Complexity: O(m * k) where m is the number of unique elements to put in hash | ||
| # and k is the number of elements to return | ||
| def top_k_frequent_elements(list, k) |
There was a problem hiding this comment.
👍 I would say this is O(n log n) since k < n, and you're potentially sorting a hash of n elements.
For space complexity since k < n, and you make a hash of potentially n elements this is O(n).
Comment on lines
+58
to
60
| # Time Complexity: O(1) constant time to iterate over table that is always 9x9 | ||
| # Space Complexity: O(1) | ||
| def valid_sudoku(table) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions