Implement Heap/Priority Queue Solutions for LeetCode Problems #31
Conversation
This file contains 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
Using Priority Queue along with a frequency map
Simplest implementation of PriorityQueue - didn't even need a custom comparator.
This was quite a different use case, and had to think outside the box. The sorted property meant I could optimize this, but couldn't think of how. I should look at this question again.
Using a priority Queue simplified the problem. The thing to remember is to not make the same calculations again and again.
Need to redo both of these
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.
This merge request implements solutions for the following LeetCode problems related to heaps and priority queues:
Q215: Kth Largest Element in an Array
Q378: Kth Smallest Element in a Sorted Matrix
Q692: Top K Frequent Words
Q973: K Closest Points to Origin
Changes
Implementation Notes
Testing
Comprehensive test cases have been added for each problem, covering various scenarios including edge cases.
All tests are passing successfully.