-
Notifications
You must be signed in to change notification settings - Fork 20k
#4387 Enhance Minimum sum partition problem implementation #4394
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I would suggest to add the examples from the description to the test file.
Could you also update the description of the problem? At the moment is not very instructive.
Does it work for input array having negative numbers? This would need some explanation.
src/main/java/com/thealgorithms/dynamicprogramming/MinimumSumPartition.java
Outdated
Show resolved
Hide resolved
src/test/java/com/thealgorithms/dynamicprogramming/MinimumSumPartitionTest.java
Outdated
Show resolved
Hide resolved
src/main/java/com/thealgorithms/dynamicprogramming/MinimumSumPartition.java
Outdated
Show resolved
Hide resolved
@vil02 This implementation is for non-negative numbers only. |
Resolves 4387
Testcase cover 100% code