PRACTICE

Heap Interview Questions

35 Heap problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Ready to try these in a real interview?

I'm Alex. I'll interview you on 2 problems like these at your level, ask follow-ups, and give you a scored report.

Start mock with Alex
🔒

to save your progress.

Companies

Topics

Heap 35
HeapClear all
347.Top K Frequent Elements
ArrayHash TableHeap
Medium+6▶ Mock
23.Merge k Sorted Lists
Linked ListHeapDivide and Conquer
Hard+4▶ Mock
253.Meeting Rooms II
ArrayHeapSorting
Medium+6▶ Mock
621.Task Scheduler
GreedyHeapHash Table
Medium+2▶ Mock
295.Find Median from Data Stream
HeapDesignData Stream
Hard+6▶ Mock
215.Kth Largest Element in an Array
ArrayDivide and ConquerSorting
Medium▶ Mock
239.Sliding Window Maximum
ArrayQueueSliding Window
Hard+2▶ Mock
2503.Maximum Number of Points from Grid Queries
ArrayTwo PointersBreadth-First Search
Hard▶ Mock
1962.Remove Stones to Minimize the Total
ArrayGreedyHeap
Medium▶ Mock
2402.Meeting Rooms III
ArrayHash TableSorting
Hard▶ Mock
1046.Last Stone Weight
ArrayHeap
Easy▶ Mock
2034.Stock Price Fluctuation
Hash TableDesignHeap
Medium▶ Mock
2353.Design a Food Rating System
ArrayHash TableString
Medium▶ Mock
3408.Design Task Manager
Hash TableDesignHeap
Medium▶ Mock
658.Find K Closest Elements
ArrayTwo PointersBinary Search
Medium▶ Mock
2812.Find the Safest Path in a Grid
ArrayBinary SearchBreadth-First Search
Medium▶ Mock
1438.Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
ArrayQueueSliding Window
Medium▶ Mock
2551.Put Marbles in Bags
ArrayGreedySorting
Hard▶ Mock
767.Reorganize String
Hash TableStringGreedy
Medium▶ Mock
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
857.Minimum Cost to Hire K Workers
ArrayGreedySorting
Hard▶ Mock
871.Minimum Number of Refueling Stops
ArrayDynamic ProgrammingGreedy
Hard▶ Mock
912.Sort an Array
ArrayDivide and ConquerSorting
Medium▶ Mock
692.Top K Frequent Words
ArrayHash TableString
Medium▶ Mock
332.Reconstruct Itinerary
ArrayStringDepth-First Search
Hard▶ Mock
272.Closest Binary Search Tree Value II
Two PointersStackTree
Hard▶ Mock
642.Design Search Autocomplete System
StringDepth-First SearchDesign
Hard▶ Mock
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
Medium▶ Mock
973.K Closest Points to Origin
ArrayMathDivide and Conquer
Medium▶ Mock
1086.High Five
ArrayHash TableSorting
Easy▶ Mock
1353.Maximum Number of Events That Can Be Attended
ArrayGreedySorting
Medium▶ Mock
1642.Furthest Building You Can Reach
ArrayGreedyHeap
Medium▶ Mock
1648.Sell Diminishing-Valued Colored Balls
ArrayMathBinary Search
Medium▶ Mock
1834.Single-Threaded CPU
ArraySortingHeap
Medium▶ Mock
3092.Most Frequent IDs
ArrayHash TableHeap
Medium▶ Mock

Practice with a Mock Interview

Solve these Heap problems under real interview pressure with our AI interviewer.

Start Mock Interview →