for first, second in periods:
    if not intersected:
        intersected = set(range(first, second + 1))
else:
    intersected = intersected.intersection(set(range(first, second + 1)))
intersected
Алгоритм нахождения самого загруженного периода?