...

/

Solution: Interval List Intersections

Solution: Interval List Intersections

Let's solve the Interval List Intersections problem using the Merge Intervals pattern.

Statement

For two arrays of closed intervals given as input, intervalsA and intervalsB, where each interval has its own start and end time, write a function that returns the intersection of the two interval arrays.

For example, the intersection of [3,8][3, 8] and [5,10][5, 10] is [5,8][5, 8].

Constraints

  • 00 \leq intervalsA.length, intervalsB.length 1000\leq 1000

  • ...