Implement a lazy chronological merge iterator with one head per active stream, stable timestamp ties, has-next semantics, exhausted streams, and bounded auxiliary memory.
Company: Amazon
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Implement a lazy chronological merge iterator with one head per active stream, stable timestamp ties, has-next semantics, exhausted streams, and bounded auxiliary memory.
Read the full Amazon Software Engineer interview experience this question came from
Blind 75
75 free coding problems to build your foundations, with hints, explanations, and a progress checklist.
Data Structures & Algorithms
The patterns behind arrays, pointers, trees, graphs and dynamic programming, with worked Python examples.
Cracking the Coding Interview Companion
Our free, unofficial companion to the book: how to analyze, solve and speed up coding problems, in Python.