Design a waitlist system with top/bottom K

Q: Design a waitlist system with top/bottom K

This question evaluates object-oriented design, data structure selection, and algorithmic complexity reasoning for implementing a waitlist that supports join/leave operations and top-K/bottom-K queries.

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: Waitlist System

Design and implement (at the class/interface level) a waitlist system that supports the following operations:

Core requirements

Join the waitlist : add a user/customer to the end of the waitlist.
Leave the waitlist : remove a specific user/customer from the waitlist.
View the queue : return the current waitlist order.
Get top K : return the first k users in the waitlist.
Get bottom K : return the last k users in the waitlist.

Clarifications / assumptions (you may choose reasonable defaults)

Each user has a unique userId .
If a user tries to join twice, define the expected behavior (e.g., no-op, move to end, or error).
If k is larger than the queue size, return as many as possible.
Aim for clean OOD and efficient time complexity for typical operations.

Provide the main classes, methods, and the data structures you would use, along with time/space complexity and key edge cases.

Design a waitlist system with top/bottom K

Quick Overview

Object-Oriented Design: Waitlist System

Core requirements

Clarifications / assumptions (you may choose reasonable defaults)

Solution

Comments (0)