Top Problems on Heap Data Structure asked in SDE Interviews
Last Updated :
29 Mar, 2025
Improve
A Heap is a special Tree-based Data Structure in which the tree is a complete binary tree. Generally, heaps are of two types: Max-Heap and Min-Heap. To know more about this Data Structure in-depth refer to the Tutorial on Heap Data-Structure.
Easy Problems
- Implement a Min Heap
- Implement a Max Heap
- Heap Sort
- Kth Smallest Element
- Minimum product of k in an array
- Sort an Almost Sorted Array
- Top K Frequent
- Min sum of two numbers from Digits
- Sum between k1’th and k2’th smallest
Medium Problems
- Convert max heap to min heap
- Convert min Heap to max Heap
- Check if a Binary Tree is a Min Heap
- Heap Sort for decreasing order using min heap
- kth smallest element in a row-column sorted matrix
- Largest triplet product in a stream
- Connect n ropes with minimum cost
- Merge two binary max heaps
- Find k closest numbers
- Sort an almost sorted array
- K maximum sum combinations from two arrays
- BST to max heap
- Convert BST to Min Heap
- K’th largest element in a stream
- k numbers with most occurrences in array
- Find the kth largest element in array
- Merge overlapping intervals
- Game with String
- Maximize The Array
- Rearrange characters
- Min sum of squares of counts after removing k
- Maximum sum of Two Non-Overlapping Intervals
- K-th Largest Sum Contiguous Subarray
Hard Problems
- Merge k sorted arrays
- Merge k Sorted Lists
- Median of a stream
- Smallest range in K lists
- Huffman Encoding
- Minimum cost to connect all cities
- Single-Source Shortest Paths – Dijkstra’s Algorithm
- Sliding Window Maximum
- K maximum sum combinations from two arrays.
Related Article:
- DSA Tutorial
- Top 50 Problems on Stack for Interviews
- Top 50 Dynamic Programming Coding Problems for Interviews
- Top 50 Problems on Linked List for Interviews
- Top 50 Problems on Queue for Interviews
