Report the minimum of a min-heap array.
Acceptance criteria
- 1.#out should show root 1.
DSA Tutorial · Heaps and Priority Queues
Practice: Heaps and Priority Queues
These 10 tasks go with the Heaps and Priority Queues chapter. 5 of them ask you to build something small from scratch; 5 give you code that is already broken and ask you to work out why. Set aside about 90 minutes for the whole set, though you can do them in any order.
Nothing here is marked by a person. When you press Submit, the editor checks your code against the points listed under each task and tells you straight away what passed and what didn't (you need a free account to submit). If you get stuck, there are hints, and a worked solution once you've had a go. The first 2 tasks are free; the rest are part of the practice plan.
If it's been a while since you read the chapter, here is how it starts: “JavaScript has no heap. You will have to write one, and it is the single most useful structure you can carry into an interview — it turns every 'top k' question from a sort into a scan.” .