Question d’entretien chez Microsoft

Implement a certain practical problem using modified data structures (e.g. Priority Queues implementation assuming two nodes can have same key; in which case higher priority should be given to the one which was inserted first)