Available question text
Given two sorted, pairwise-disjoint lists of closed intervals, return all non-empty intersections between intervals from the two lists. Because each list is ordered and non-overlapping, the overlaps can be produced by scanning both lists simultaneously in linear time.
Related questions
Continue with questions that share topics or the same question type.
- 3Sum
Coding · Array · Sorting · Two Pointers
- 3Sum Closest
Coding · Array · Sorting · Two Pointers
- 4Sum
Coding · Array · Sorting · Two Pointers
- Advantage Shuffle
Coding · Array · Greedy · Sorting
Sources · 2 references
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
Leetcode 986. Interval List Intersections
Reported Sep 7, 2025 · 6 source reports
JUNIOR, MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Verkada
Interval List Intersections
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 100. This is not an interview probability.
View source