#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/interval-problems/interval-intersections-implementation

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/greedy-algorithms/interval-problems/interval-intersections-implementation

Repovive

Interval Intersections - Implementation - Interval Problems | Greedy Algorithms | Repovive

Repovive.

Greedy Algorithms8 sections · 317 units14h total

Open in Course

Interval Intersections - Implementation

The code

function intervalIntersection(A, B)
 result := []
 i := 0
 j := 0
 while i < length of A and j < length of B
 lo := max(A[i].start, B[j].start)
 hi := min(A[i].end, B[j].end)
 if lo <= hi then
 result.append([lo, hi])
 if A[i].end < B[j].end then
 i := i + 1
 else
 j := j + 1
 return result

Time: $O(n + m)$ . Space: $O(1)$ extra.