Can't a simpler implementation of adding up the loads of an interval work.

need to sort the array

def max_cpu_load(jobs):

if len(jobs) < 2: return jobs[0][2]

start = jobs[0][0] end = jobs[0][1] load = jobs[0][2] max_load = load

for i in range(1, len(jobs)): j = jobs[i] if j[0] < end: load += j[2] max_load = max( load, max_load ) end = max( end, j[1]) else: load = j[2] max_load = max(load, max_load) return max_load

print( max_cpu_load([[1,4,3], [2,5,4], [7,9,6]]) ) print( max_cpu_load([[2,4,11], [6,7,10], [8,12,15]]) ) print( max_cpu_load([[1,4,2], [2,4,1], [3,6,5]]) )