Top 50 Problems on Heap Data Structure asked in SDE Interviews Last Updated : 23 Jun, 2023 Improve Improve Like Article Like Save Share Report 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. Given below are the most frequently asked interview questions on Heaps: Easy Interview Questions on Heap Data Structure Kth smallest element in an array Minimum product of k integers in an array of positive Integers Sort an Almost Sorted Array Top K Frequent Elements Height of a complete binary tree (or Heap) with N nodes Minimum sum of two numbers formed from digits of an array Kth smallest element in a row-wise and column-wise sorted 2D array Sum of all elements between k1’th and k2’th smallest elements Medium Interview Questions on Heap Data Structure Implement a Min Heap Implement a Max Heap Heap Sort Convert max heap to min heap Convert min Heap to max Heap Check if a Binary Tree is a Min Heap Check if a Binary Tree is a Max Heap Binary Heap Given level order traversal of a Binary Tree, check if the Tree is a Min-Heap Implement a priority queue How to implement Priority Queue – using Heap or Array? Heap Sort for decreasing order using min heap Find 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 Find k numbers with most occurrences in the given array Find the kth largest element in an array Merge overlapping intervals Game with String Nearly sorted Maximize The Array Rearrange characters Minimum sum of squares of character counts in a given string after removing k characters Maximum sum of at most two non-overlapping intervals in a list of Intervals K-th Largest Sum Contiguous Subarray Hard Interview Questions on Heap Data Structure Merge k sorted arrays Merge k Sorted Lists Find the median of a stream of running integers Smallest range in K lists Huffman Encoding Minimum cost to connect all cities Single-Source Shortest Paths – Dijkstra’s Algorithm Sliding Window Maximum (Maximum of all subarrays of size K) K maximum sum combinations from two arrays Merge two sorted arrays in O(1) extra space using Heap Like Article Suggest improvement Previous Top 50 Problems on Linked List Data Structure asked in SDE Interviews Next Data Analyst Interview Questions and Answers Share your thoughts in the comments Add Your Comment Please Login to comment...