# Heap

- [Kth Largest Element in an Array (Leetcode 215)](/dsa-in-python/heap/kth-largest-element-in-an-array-leetcode-215.md)
- [Top K Frequent Elements (Leetcode 347)](/dsa-in-python/heap/top-k-frequent-elements-leetcode-347.md)
- [Kth Largest Element In A Stream](/dsa-in-python/heap/kth-largest-element-in-a-stream.md): If you want k largest or kth largest, implement minheap
- [K Closest Points to Origin](/dsa-in-python/heap/k-closest-points-to-origin.md)
- [Last Stone Weight](/dsa-in-python/heap/last-stone-weight.md)
- [\*\*\* Find Median from Data Stream (Leetcode 295)](/dsa-in-python/heap/find-median-from-data-stream-leetcode-295.md)
- [\*\*\*The Skyline Problem (Leetcode 218)](/dsa-in-python/heap/the-skyline-problem-leetcode-218.md)
