Waitlist with top-K and bottom-K queries
Build a waitlist. People join with a priority (or a join time), can leave, and the system answers two queries at any moment: the top k entries and the bottom k entries. Choose data structures so joining, leaving and both queries are fast, and give their costs.
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.