-
Notifications
You must be signed in to change notification settings - Fork 59
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
Sumitra(hash practice) #30
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.
Really nice work Sumitra, well done. You hit the learning goals here.
def grouped_anagrams(strings): | ||
""" This method will return an array of arrays. | ||
Each subarray will have strings which are anagrams of each other | ||
Time Complexity: ? | ||
Space Complexity: ? | ||
Time Complexity: O(n) | ||
Space Complexity: O(n) | ||
""" |
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.
👍
def top_k_frequent_elements(nums, k): | ||
""" 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: ? | ||
|
||
Time complexity: O(N log(k)). | ||
Space complexity: O(N). | ||
""" |
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 use of a heap!
def valid_sudoku(table): | ||
""" This method will return the true if the table is still | ||
a valid sudoku table. | ||
Each element can either be a ".", or a digit 1-9 | ||
The same digit cannot appear twice or more in the same | ||
row, column or 3x3 subgrid | ||
Time Complexity: ? | ||
Space Complexity: ? | ||
Time Complexity: O(n2) | ||
Space Complexity: O(n) | ||
""" |
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.
Since Sudoko boards are always 9x9, you can just say O(1) time/space complexity.
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions