avinash201199 / avinash201199/DSA-Questions
Dynamic Programming : Minimum Sum Partition
Open
good first issue
hacktoberfest
- Dominant language
- C++
- Stars
- 88
- Forks
- 167
- PR merge metrics
- No merged PRs in 30d
Description
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
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.