Solving the Top k most frequent words problem using a max-heap #196
Conversation
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
StepfenShawn approved these changes Feb 10, 2023
Member
StepfenShawn left a comment
StepfenShawn left a comment There was a problem hiding this comment.
Thanks for your contribution!
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
2 participants
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.
This PR aims to add an algorithm to identify the top
kmost frequent strings given a provided string list of elements.To do this, the algorithm is using a max-heap implementation already existing in this repository.
Time complexity is
O(n), where n is the number of words:O(n)for building the max-heapk*O(logn)for extracting the k most frequent strings