# Heap

- [215    Kth Largest Element in an Array](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/215-kth-largest-element-in-an-array.md)
- [239 Sliding Window Maximum](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/239-sliding-window-maximum.md)
- [253    Meeting Rooms II](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/253-meeting-rooms-ii.md)
- [264    Ugly Number II](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/264-ugly-number-ii.md)
- [295    Find Median from Data Stream](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/295-find-median-from-data-stream.md)
- [313    Super Ugly Number](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/313-super-ugly-number.md)
- [347    Top K Frequent Elements](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/347-top-k-frequent-elements.md)
- [358    Rearrange String k Distance Apart](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/358-rearrange-string-k-distance-apart.md)
- [373    Find K Pairs with Smallest Sums](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/373-find-k-pairs-with-smallest-sums.md)
- [378 Kth Smallest Element in a Sorted Matrix](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/378-kth-smallest-element-in-a-sorted-matrix.md)
- [407 Trapping Rain Water II](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/407-trapping-rain-water-ii.md)
- [451    Sort Characters By Frequency](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/451-sort-characters-by-frequency.md)
- [480 Sliding Window Median](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/480-sliding-window-median.md)
- [502    IPO](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/502-ipo.md)
- [659    Split Array into Consecutive Subsequences](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/659-split-array-into-consecutive-subsequences.md)
- [668    Kth Smallest Number in Multiplication Table](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/668-kth-smallest-number-in-multiplication-table.md)
- [692    Top K Frequent Words](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/692-top-k-frequent-words.md)
- [759 Employee Free Time](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/759-employee-free-time.md)
- [767 Reorganize String](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/767-reorganize-string.md)
- [778 Swim in Rising Water](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/778-swim-in-rising-water.md)
- [973. K Closest Points to Origin](https://protegejj.gitbook.io/algorithm-practice/leetcode/heap/973.-k-closest-points-to-origin.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://protegejj.gitbook.io/algorithm-practice/leetcode/heap.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.