Partition Array Minimizing Subset Sum Difference

Given an array containing N non-negative integers, your task is to partition this array into two subsets such that the absolute difference between their sums is minimized. You only need to find the minimum absolute difference without outputting the subsets themselves.

Input:

The first line contains a single integer T, the number of test cases.
For each test case:
The first line contains an integer N, the size of the array.
The second line contains N space-separated integers denoting the array elements.

Output:

For each test case, output the minimum possible absolute difference on a new line.

Example:

Input:
T = 1
N = 3
Array = [1, 2, 3]

Output:
0

Constraints:

• 1 <= T <= 10
• 1 <= N <= 10^3
• 0 <= ARR[i] <= 10^3
• 0 <= SUM <= 10^4 (where SUM is the sum of array elements in a test case)

Note:

• Each element must belong to exactly one subset.
• Subsets do not need to be contiguous.
• Subset-sum refers to the sum of elements within that subset.