Priority Queue Problems
Less than 1 minute
| Problem Number | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0703 | Kth Largest Element in a Stream | [[LeetCode 0703]] | Tree, Design, Binary Search Tree, Binary Tree, Data Stream, Heap (Priority Queue) | Easy |
| 0347 | Top K Frequent Elements | [[LeetCode 0347]] | Array, Hash Table, Divide and Conquer, Bucket Sort, Counting, Quick Select, Sorting, Heap (Priority Queue) | Medium |
| 0451 | Sort Characters By Frequency | [[LeetCode XXXX]] | Hash Table, String, Bucket Sort, Counting, Sorting, Heap (Priority Queue) | Medium |
| 0973 | K Closest Points to Origin | [[LeetCode XXXX]] | Geometry, Array, Math, Divide and Conquer, Quick Select, Sorting, Heap (Priority Queue) | Medium |
| 1296 | Divide Array in Sets of K Consecutive Numbers | [[LeetCode XXXX]] | Greedy, Array, Hash Table, Sorting | Medium |
| 0239 | Sliding Window Maximum | [[LeetCode 0239]] | Queue, Array, Sliding Window, Monotonic Queue, Heap (Priority Queue) | Hard |
| 0295 | Find Median from Data Stream | [[LeetCode 0295]] | Design, Two Pointers, Data Stream, Sorting, Heap (Priority Queue) | Hard |
| 0023 | Merge k Sorted Lists | [[LeetCode XXXX]] | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard |
| 0218 | The Skyline Problem | [[LeetCode 0218]] | Fenwick Tree, Segment Tree, Array, Divide and Conquer, Ordered Set, Sweep Line, Heap (Priority Queue) | Hard |