https://github.com/ndsvw/minimum-sum-partitioning
Dynamic-Programming solution of the "Minimum-Sum-Partitioning"-Problem: Given a list: What is the minimum absolute difference between the the sums of 2 arrays consisting of all the elements from the input array?
https://github.com/ndsvw/minimum-sum-partitioning
algorithm algorithm-challenge dynamic-programming
Last synced: 4 months ago
JSON representation
Dynamic-Programming solution of the "Minimum-Sum-Partitioning"-Problem: Given a list: What is the minimum absolute difference between the the sums of 2 arrays consisting of all the elements from the input array?
- Host: GitHub
- URL: https://github.com/ndsvw/minimum-sum-partitioning
- Owner: ndsvw
- License: mit
- Created: 2020-01-31T07:00:18.000Z (over 5 years ago)
- Default Branch: master
- Last Pushed: 2020-02-01T06:46:07.000Z (over 5 years ago)
- Last Synced: 2025-01-14T02:25:52.782Z (5 months ago)
- Topics: algorithm, algorithm-challenge, dynamic-programming
- Language: Python
- Size: 3.91 KB
- Stars: 0
- Watchers: 3
- Forks: 0
- Open Issues: 0