problem352

README

< Previous 　　　　　　　　　　　　　　　　 Next >

352. Data Stream as Disjoint Intervals (Hard)

Given a data stream input of non-negative integers a₁, a₂, ..., a_n, ..., summarize the numbers seen so far as a list of disjoint intervals.

For example, suppose the integers from the data stream are 1, 3, 7, 2, 6, ..., then the summary will be:

[1, 1]
[1, 1], [3, 3]
[1, 1], [3, 3], [7, 7]
[1, 3], [7, 7]
[1, 3], [6, 7]

 

Follow up:

What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?

Related Topics

[Binary Search] [Ordered Map]

Similar Questions

1. Summary Ranges (Easy)
2. Find Right Interval (Medium)
3. Range Module (Hard)