How to Find Intersection of Two Sorted Interval Lists in Python

def interval_intersection(list1, list2):
    i = j = 0
    result = []
    
    while i < len(list1) and j < len(list2):
        # Find the overlap between current intervals
        lo = max(list1[i][0], list2[j][0])
        hi = min(list1[i][1], list2[j][1])
        
        # If there's an overlap, add it to result
        if lo <= hi:
            result.append([lo, hi])
        
        # Move pointer of the interval that ends first
        if list1[i][1] < list2[j][1]:
            i += 1
        else:
            j += 1
    
    return result


if __name__ == "__main__":
    # Example: two sorted lists of intervals
    first = [[0, 2], [5, 10], [13, 23], [24, 25]]
    second = [[1, 5], [8, 12], [15, 24], [25, 26]]
    
    intersections = interval_intersection(first, second)
    print(intersections)