|
32 | 32 | - [14. Euler Circuit](#14-euler-circuit) |
33 | 33 | - [15. Fenwick Tree](#15-fenwick-tree) |
34 | 34 | - [16. Greedy Scheduling](#16-greedy-scheduling) |
35 | | - - [17. Heaps](#17-heaps) |
| 35 | + - [17. Heaps (Priority Queues)](#17-heaps-priority-queues) |
36 | 36 | - [18. Intervals](#18-intervals) |
37 | 37 | - [19. Line Sweep](#19-line-sweep) |
38 | 38 | - [20. Linked List](#20-linked-list) |
|
249 | 249 | |1|[Maximum Number of Events That Can Be Attended](https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/)|Medium|[Solution](https://github.com/kiranpalsingh1806/awesome-dsa/blob/master/SOLUTIONS.md)| |
250 | 250 | |2|[Single Threaded CPU](https://leetcode.com/problems/single-threaded-cpu/)|Medium|[Solution](https://github.com/kiranpalsingh1806/awesome-dsa/blob/master/SOLUTIONS.md)| |
251 | 251 |
|
252 | | -## 17. Heaps |
| 252 | +## 17. Heaps (Priority Queues) |
| 253 | + |
| 254 | +|S.No|Problem|Difficulty|Solution| |
| 255 | +|-|------|--------|------| |
| 256 | +|1|[Sort Array By Increasing Frequency](https://leetcode.com/problems/sort-array-by-increasing-frequency/)|Easy|[Solution](/solutions/heaps)| |
| 257 | +|2|[Kth Largest Element in An Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)|Medium|[Solution](/solutions/heaps)| |
| 258 | +|3|[Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/)|Medium|[Solution](/solutions/heaps)| |
| 259 | +|4|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)|Medium|[Solution](/solutions/heaps)| |
| 260 | +|5|[Find K Closest Elements](https://leetcode.com/problems/find-k-closest-elements/)|Medium|[Solution](/solutions/heaps)| |
| 261 | +|6|[Top K Frequent Words](https://leetcode.com/problems/top-k-frequent-words/)|Medium|[Solution](/solutions/heaps)| |
| 262 | +|7|[K Closest Points To Origin](https://leetcode.com/problems/k-closest-points-to-origin/)|Medium|[Solution](/solutions/heaps)| |
| 263 | +|8|[Reduce Array Size To The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)|Medium|[Solution](/solutions/heaps)| |
| 264 | +|9|[Reorganize String](https://leetcode.com/problems/reorganize-string/)|Medium|[Solution](/solutions/heaps)| |
| 265 | +|10|[Sender With Largest Word Count](https://leetcode.com/problems/sender-with-largest-word-count/)|Medium|[Solution](/solutions/heaps)| |
| 266 | +|11|[Minimum Difference In Sums After Removal of Elements](https://leetcode.com/problems/minimum-difference-in-sums-after-removal-of-elements/)|Hard|[Solution](/solutions/heaps)| |
| 267 | +|12|[Course Schedule III](https://leetcode.com/problems/course-schedule-iii/)|Hard|[Solution](/solutions/heaps)| |
| 268 | +|13|[Maximum Frequency Stack](https://leetcode.com/problems/maximum-frequency-stack/)|Hard|[Solution](/solutions/heaps)| |
253 | 269 |
|
254 | | -|Problem|Difficulty|Solution| |
255 | | -|------|--------|------| |
256 | | -[]()|Medium|[Solution](https://github.com/kiranpalsingh1806/awesome-dsa/blob/master/SOLUTIONS.md)| |
257 | 270 |
|
258 | 271 | ## 18. Intervals |
259 | 272 |
|
|
0 commit comments