Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Given an integer array **arr** of size **N**, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum and find the minimum difference

**Example 1:**

Input: N = 4, arr[] = {1, 6, 11, 5}Output:1Explanation: Subset1 = {1, 5, 6}, sum of Subset1 = 12 Subset2 = {11}, sum of Subset2 = 11

**Input: **N = 2, arr[] = {1, 4}
**Output: **3
**Explanation**:
Subset1 = {1}, sum of Subset1 = 1
Subset2 = {4}, sum of Subset2 = 4

**Your Task: **

You don't need to read input or print anything. Complete the function ** minDifference() **which takes

**Expected Time Complexity:** O(**N*|sum of array elements|**)

**Expected Auxiliary Space:** O(**N*|sum of array elements|**)

**Constraints:**

1 ≤ **N*|sum of array elements|** ≤ 10^{6}

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Minimum sum partition

...