Sets with smallest discrepancy Given an integer array arr , write a function that returns the smallest possible difference between the sums of two groups when the values in arr are divided between them. Example 1 > - **Input:** arr = [1, 5, 3, 10] > - **Output:** 1 > - **Explanation:** The total is `19`, and putting `10` on one side against `1`, `5` and `3` on the other gives `10` against `9`, a gap of `1`. Example 2 > - **Input:** arr = [1, 2, 3, 4, 5] > - **Output:** 1 > - **Explanation:** The total is `15`, and putting `1`, `2` and `5` on one side gives `8` against `7`, a gap of `1`. Example 3 > - **Input:** arr = [1, 1] > - **Output:** 0 > - **Explanation:** The two values are equal, so one on each side leaves no gap at all. Constraints > - `0 - `0 <= arr[i] <= 100`

Sets with smallest discrepancy | Dynamic Programming

Liking the course? Check our discounted plans to continue learning.