Design an ads retrieval service using a heap

Q: Design an ads retrieval service using a heap

This question evaluates understanding of priority queues/heaps, object-oriented API design, and algorithmic techniques for maintaining dynamic priorities such as add, remove, and update operations.

Q: How do I approach Software Engineering Fundamentals interview questions?

Software Engineering Fundamentals questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master software engineering fundamentals interviews.

Question

Loading...

Object-Oriented Design: Ads Retrieval (Priority-Based)

Design a component that manages ads and supports retrieving the “best” ads based on a score.

Requirements

Implement APIs such as:

addAd(adId, score, metadata) -> void
removeAd(adId) -> bool
updateScore(adId, newScore) -> bool
getTopAd() -> Ad | null (or getTopK(k) -> List<Ad> )

Assume higher score means higher priority.

Constraints / Expectations

Use a heap / priority queue as the main structure.
Discuss time/space complexity .
Handle duplicates and updates correctly (e.g., score changes).

Follow-ups

How do you handle updateScore efficiently given that typical heaps don’t support decrease/increase-key by ID?
How do you ensure getTopAd() doesn’t return ads that were removed or superseded by a newer score?

Design an ads retrieval service using a heap

Quick Overview

Object-Oriented Design: Ads Retrieval (Priority-Based)

Requirements

Constraints / Expectations

Follow-ups

Solution

Comments (0)