Loading…
Implement Min Heap is a medium coding interview question covering heap, design, arrays — the kind asked at FAANG (Facebook/Meta, Apple, Amazon, Netflix, Google) and AI-first companies like Anthropic, OpenAI, and Nvidia.
Implement a Min Heap from scratch with: - insert(val): add a value, O(log n) - extract_min(): remove and return minimum, O(log n) - peek(): view minimum, O(1)
The heap must maintain the heap invariant: every parent is smaller than or equal to its children.
Heaps are used in priority queues, Dijkstra's algorithm, A* search, and top-k queries.
Solution walkthrough on Pro
Upgrade to Pro to unlock the guided hints, the step-by-step walkthrough, solutions in Python, C++, Java, and Go, and complexity analysis.
What's inside this guide
Fully unlocked, no account needed — solutions, walkthroughs and follow-up answers included.
Or start the Study Plan — a week-by-week order for your loop, and week 1 is entirely free.
A full interview loop is more than one round. These are the others, each with what is on the site for it.