Hardware interview practice
Merge sorted transaction queues
Merge two queues of transactions sorted by id into one stable sorted queue.
Reviewed example
Work through one case
Input
queue A=[(id1,A1),(id3,A3)]; queue B=[(id1,B1),(id2,B2),(id3,B3)]Expected output
merged=[A1,B1,B2,A3,B3]On equal IDs the first queue wins, preserving stable order while neither input queue is mutated.
What to cover
Requirements
- Prefer the first queue when ids are equal.
- Do not mutate the input queues.
- Append every remaining transaction.