← Questions
Waitlist with top-K and bottom-K queries
0
I was asked this
No reports yet. Sign in to say where you were asked it.
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.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding