How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Google.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Google during technical interviews.

Compute the Union of Two Sorted Interval Lists

Last updated: Aug 16, 2026

Quick Overview

Compute the union of two sorted, nonoverlapping lists of closed intervals. Merge the two streams in linear time, combining endpoint-touching, duplicate, contained, and cross-list intervals correctly.

medium
Google
Coding & Algorithms
Software Engineer

|Home/Coding & Algorithms/Google

Compute the Union of Two Sorted Interval Lists

Google

Aug 6, 2026

mediumSoftware EngineerOnsiteCoding & Algorithms

PracticeRead

Submit Your Answer to Earn 20XP

Loading comments...

Browse More Questions

More Coding & Algorithms•More Google•More Software Engineer•Google Software Engineer•Google Coding & Algorithms•Software Engineer Coding & Algorithms