<p>You are given an integer array <code>nums</code> of <code>2 * n</code> integers. You need to partition <code>nums</code> into <strong>two</strong> arrays of length <code>n</code> to <strong>minimize the absolute difference</strong> of the <strong>sums</strong> of the arrays. To partition <code>nums</code>, put each element of <code>nums</code> into <strong>one</strong> of the two arrays.</p>

<p>Return <em>the <strong>minimum</strong> possible absolute difference</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="example-1" src="https://assets.leetcode.com/uploads/2021/10/02/ex1.png" style="width: 240px; height: 106px;" />
<pre>
<strong>Input:</strong> nums = [3,9,7,3]
<strong>Output:</strong> 2
<strong>Explanation:</strong> One optimal partition is: [3,9] and [7,3].
The absolute difference between the sums of the arrays is abs((3 + 9) - (7 + 3)) = 2.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [-36,36]
<strong>Output:</strong> 72
<strong>Explanation:</strong> One optimal partition is: [-36] and [36].
The absolute difference between the sums of the arrays is abs((-36) - (36)) = 72.
</pre>

<p><strong class="example">Example 3:</strong></p>
<img alt="example-3" src="https://assets.leetcode.com/uploads/2021/10/02/ex3.png" style="width: 316px; height: 106px;" />
<pre>
<strong>Input:</strong> nums = [2,-1,0,4,-2,-9]
<strong>Output:</strong> 0
<strong>Explanation:</strong> One optimal partition is: [2,4,-9] and [-1,0,-2].
The absolute difference between the sums of the arrays is abs((2 + 4 + -9) - (-1 + 0 + -2)) = 0.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= n &lt;= 15</code></li>
	<li><code>nums.length == 2 * n</code></li>
	<li><code>-10<sup>7</sup> &lt;= nums[i] &lt;= 10<sup>7</sup></code></li>
</ul>

import numpy as np
class Solution:
    def split (self, nums: List[int]) -> List[List[int]]:
        n = len(nums) 
        dp = [ [] for _ in range(n + 1) ]
        pw = (1 << (n - 1))
        sm = sum(nums)
        for i in range(pw) :
            x = sum(nums[j] for j in range(len(nums)) if i & (1 << j))
            dp[i.bit_count()].append(sm - 2 * x)
            dp[n - i.bit_count()].append(-(sm - 2 * x))
        for i in range(len(dp)) :
            dp[i].sort()
        return dp    

    def minimumDifference(self, nums: List[int]) -> int:
        n = len(nums)
        a = self.split(nums[0:int(n/2)])
        b = self.split(nums[int(n/2):n])
        mn = 100000000
        for i1 in range(len(a)) :
            i2 = int(n/2) - i1
            r = len(b[i2]) - 1
            for j1 in range(len(a[i1])) :
                if len(b[i2]) == 0 or b[i2][len(b[i2]) - 1] + a[i1][j1] < 0 :
                    continue
                l = bisect.bisect_left(b[i2], -a[i1][j1])
                if mn > a[i1][j1] + b[i2][l] :
                    mn = a[i1][j1] + b[i2][l]
        return mn
3601