İki alt diziye bölme

def min_diff_opt(arr):
    s = sum(arr); n = len(arr); dp = [[False]*(s+1) for _ in range(n+1)]
    for i in range(n+1): dp[i][0] = True
    for i in range(1, n+1):
        for j in range(1, s+1):
            if j < arr[i-1]: dp[i][j] = dp[i-1][j]
            else: dp[i][j] = dp[i-1][j] or dp[i-1][j-arr[i-1]]
    res = float('inf')
    for j in range(s // 2, -1, -1):
        if dp[n][j]: res = s - 2*j; break
    return res

def min_diff_brute(arr):
    def solve(i, s1, s2):
        if i == len(arr): return abs(s1 - s2)
        return min(solve(i+1, s1+arr[i], s2), solve(i+1, s1, s2+arr[i]))
    return solve(0, 0, 0)