<jupyter_start><jupyter_text>Given a list_of_ints, find the highest_product you can get from three of the integers.The input list_of_ints will always have at least three integers.<jupyter_code>def find_minmax(arr):
    minX, maxX = 0, 0
    for i,x in enumerate(arr):
        if x < arr[minX]:
            minX = i
        if x > arr[maxX]:
            maxX = i
    return (minX, maxX)

def highest_product_N(arr, pN=3):
    maxNums, minNums = arr[:pN], arr[:pN]
    
    for x in arr[pN:]:
        minx = find_minmax(maxNums)[0]
        maxx = find_minmax(minNums)[1]
        
        if x > maxNums[minx]:
            maxNums[minx] = x
        if x < minNums[maxx]:
            minNums[maxx] = x
    minNums.sort()
    maxNums.sort(reverse=True)
    print minNums, maxNums
    #minmaxSorted = sorted(maxNums + minNums)
    #print minmaxSorted
    
    minC, maxC = [1], [1]
    for i in range(0,pN):
        minC.append(minC[-1]*minNums[i])
        maxC.append(maxC[-1]*maxNums[i])
    print minC, maxC
        
    maxMult = list()
    for i in range(pN+1):
        maxMult.append(minC[i] * maxC[pN-i])
    return max(maxMult)
        
    
x = [1,5,4,2,7,3,9,1]
print highest_product_N(x,5)

x = [1,5,4,2,7,3,-9,1]
print highest_product_N(x,5)

x = [1,5,4,2,7,3,-9,-8]
print highest_product_N(x,5)<jupyter_output>[1, 1, 2, 3, 4] [9, 7, 5, 4, 3]
[1, 1, 1, 2, 6, 24] [1, 9, 63, 315, 1260, 3780]
3780
[-9, 1, 1, 2, 3] [7, 5, 4, 3, 2]
[1, -9, -9, -9, -18, -54] [1, 7, 35, 140, 420, 840]
840
[-9, -8, 1, 2, 3] [7, 5, 4, 3, 2]
[1, -9, 72, 72, 144, 432] [1, 7, 35, 140, 420, 840]
10080<jupyter_text>Your company built an in-house calendar tool called HiCal. You want to add a feature to see the times in a day when everyone is available.To do this, you’ll need to know when any team is having a meeting. In HiCal, a meeting is stored as tuples ↴ of integers (start_time, end_time) . These integers represent the number of 30-minute blocks past 9:00am.<jupyter_code>def merge_times(meetings):
    pass

m = [(0, 1), (3, 5), (4, 8), (10, 12), (9, 10)]
merge_times(m) # [(0, 1), (3, 8), (9, 12)]<jupyter_output><empty_output>
{'fraction_non_alphanumeric': 0.1562057574327513, 'fraction_numerical': 0.08164228409627183, 'mean_word_length': 2.8545454545454545, 'pattern_counts': {'":': 0, '<': 10, '<?xml version=': 0, '>': 10, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 2, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'chain_length': '2', 'dir': 'jupyter-structured-clean-dedup', 'id': '456927', 'license': 'MIT', 'n_tokens_mistral': 1010, 'n_tokens_neox': 894, 'n_words': 264, 'path': 'interviewcake.ipynb', 'repo_name': 'onurvarol/playground', 'size': '2119'}