What is a Heap? (Min-Heap and Max-Heap)

0-2 years experience

1. 1Suppose you need to implement a feature that always shows the next upcoming event in a calendar app. How would you use a min‑heap to retrieve the soonest event, and what is the time complexity of inserting a new event?
2. 2If you have an array representing a max‑heap and you accidentally swap two elements, how does that affect the heap property and what steps would you take to restore it?
3. 3When you pop the top element from a min‑heap, what changes occur in the underlying array representation?

2-5 years experience

1. 1Our job scheduler stopped picking the highest‑priority jobs after a recent refactor. Walk me through how you would debug the issue assuming the scheduler uses a max‑heap.
2. 2We need to support both min‑heap and max‑heap behavior in a single priority‑queue library. What design choices would you make, and how would you expose the API to keep the implementation efficient?
3. 3During a load test, inserting one million tasks into a heap took longer than expected. What factors could cause this slowdown and how would you profile or optimize it?

5-8 years experience

1. 1Design a real‑time leaderboard that must return the top‑K players quickly while supporting frequent score updates. How would you use a heap, and what trade‑offs does it have versus other structures?
2. 2Our distributed task queue stores pending tasks in a heap persisted to disk. Explain how you would ensure heap consistency across node failures and what recovery strategy you’d employ.
3. 3When scaling a priority‑queue service to millions of concurrent users, what bottlenecks arise from using a single in‑memory heap, and how would you redesign the system to maintain low latency?

8+ years experience

1. 1We are migrating a legacy C++ priority‑queue implementation that uses a binary heap to a new microservice architecture written in Go. What migration plan would you propose to minimize downtime and ensure correctness across services?
2. 2Across several teams, different services have adopted custom heap variants like pairing or Fibonacci heaps. How would you evaluate whether to standardize on one implementation, and what criteria would guide that decision?
3. 3Our organization wants to expose a heap‑based priority API to external partners while guaranteeing O(log n) performance and safe concurrent access. Describe the architectural considerations and patterns you’d employ.