โขPRACTICE
Heap Interview Questions
12 Heap problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.
Filter by company
Clear all โFilter by topic
Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
๐
to save your progress.
| โ 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Top K Frequent Elements | Medium | 7 companies | View breakdown โ | ||
| Merge k Sorted Lists | Hard | 6 companies | View breakdown โ | ||
| Meeting Rooms II | Medium | 8 companies | View breakdown โ | ||
| Task Scheduler | Medium | 6 companies | View breakdown โ | ||
| Find Median from Data Stream | Hard | 8 companies | View breakdown โ | ||
| Kth Largest Element in an Array | Medium | 2 companies | View breakdown โ | ||
| Sliding Window Maximum | Hard | 3 companies | View breakdown โ | ||
| Maximum Number of Points from Grid Queries | Hard | 1 companies | View breakdown โ | ||
| Remove Stones to Minimize the Total | Medium | 1 companies | View breakdown โ | ||
| Meeting Rooms III | Hard | 2 companies | View breakdown โ | ||
| Last Stone Weight | Easy | 2 companies | View breakdown โ | ||
| Stock Price Fluctuation | Medium | 1 companies | View breakdown โ |
Practice with a Mock Interview
Solve these Heap problems under real interview pressure with our AI interviewer.
Start Mock Interview โ