Brute force solution for dividing array into 3 parts of equal sum

best_dividion.py

def best_division(a):
    """
    This function performs exhastive search over all possible divisions of array into 3 parts with equal sums
    a - array on numbers (list<int|float>)
    """
    results = []
    for i in range(1, len(a)-2+1):
        for j in range(i+1, len(a)-1+1):
            first, second, third = sum(a[:i]), sum(a[i:j]), sum(a[j:])
            opt_func = abs(first - second) + abs(second - third) + abs(first - third)
            results.append([opt_func, [[i, j], [first, second, third]]])
            
    sorted_res = sorted(results, key=lambda x: x[0])
    return sorted_res[0]