Merge Sorted Event Streams Through an Iterator

Read the full interview experience this question came from →

Quick 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.

Merge Sorted Event Streams Through an Iterator

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

Amazon logo
Amazon
Sep 14, 2026
mediumSoftware EngineerOnsiteCoding & Algorithms
8
0
Loading...