-
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 - mackenzie #20
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.
Nice work Mackenzie, you hit the learning goals here. Well done.
# Time Complexity: O(nm(log m)) + O(n) (sort_by for each string + length of strings array) | ||
# Space Complexity: O(n) (hash size increases with input array length, no other data structures made) | ||
|
||
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.
👍 Nice!
# Time Complexity: O(n) + O(n logn) ( sort is nlogn, list.each is n, map is n) | ||
# Space Complexity: O(n) (multiple same sized arrays) | ||
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.
👍 So the final time complexity is O(n log n) because that's the bigger term.
sorted = counted.sort {|a,b| b[1]<=>a[1]} | ||
keys = sorted.map { |n| n[0] } |
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.
Very compact!
Hash Table Practice
Congratulations! You're submitting your assignment!
Comprehension Questions