@@ -0,0 +1,588 @@
+%22%22%22%0Ahttps://codility.com/programmers/task/min_abs_sum_of_two/%0A%22%22%22%0A%0A%0Afrom bisect import bisect_left%0A%0A%0Adef solution(A):%0A    if 0 in A:%0A        return 0%0A    elif all(a %3E 0 for a in A):%0A        return 2 * min(A)%0A    elif all(a %3C 0 for a in A):%0A        return -2 * max(A)%0A    else:%0A        neg, pos = sorted(a for a in A if a %3C 0), %5Ba for a in A if a %3E 0%5D%0A        result = float('inf')%0A%0A        for p in pos:%0A            i = bisect_left(neg, -p)%0A            smaller = min(abs(p + neg%5Bj%5D) for j in (i, i-1) if 0 %3C= j %3C len(neg))%0A            result = min(result, smaller)%0A%0A        return result%0A

Create min_abs_sum_of_two.py