Available question text
Given two sorted lists of non-overlapping intervals (A and B), return a new sorted list representing the union of both interval lists. Any overlapping or adjacent intervals from the two lists should be merged into a single combined interval in the output. The result should be a minimal set of non-overlapping intervals covering all ranges from both input lists.
Related questions
Continue with questions that share topics or the same question type.
- Merge Two Sorted Lists
Coding · Linked List · Recursion
- Merge k Sorted Lists
Coding · Divide and Conquer · Heap (Priority Queue) · Linked List
- Add Two Polynomials Represented as Linked Lists
Coding
- Deep Merge of Two Objects
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Union / Merge of Two Sorted Interval Lists
Reported Apr 1, 2026 · 3 source reports
MID_LEVEL, STAFF
Source snapshot: Nov 12, 2026
View source