Design a data structure to handle actions with Priority Queues
Filed under Uber
The question
Create a design to handle insertion and updates, exploring different implementations like arrays, linked lists, BST, and Priority Queues including Binary, Fibonacci, and Pairing heaps.
No write-up yet. Related questions below have one.
Related Uber questions
Collected from public candidate posts and coding forums. Updated Nov 2026.