Skip to content

Feat : Enhance Minimum sum partition #4387

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.

Sign up for GitHub

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

Jump to bottom
Closed
Manan-09 opened this issue Sep 20, 2023 · 0 comments · Fixed by #4394
Closed

Feat : Enhance Minimum sum partition #4387

Manan-09 opened this issue Sep 20, 2023 · 0 comments · Fixed by #4394
Assignees
@Manan-09
Labels
enhancement

Comments

@Manan-09
Copy link
Contributor

What would you like to Propose?

We can implement Minimum Sum partition with O( sum) space complexity with same time complexity and also reduce some for loop to reduce overall time taken by this code.

Issue details

Current implementation takes O( n * sum) space complexity but we can do it in O( sum ) only

Additional Information

No response
@Manan-09 Manan-09 mentioned this issue Sep 21, 2023
Merged
5 tasks
vil02 added a commit that referenced this issue Sep 23, 2023
@Manan-09 @vil02
#4387 Enhance Minimum sum partition problem implementation (#4394)
8803b1e 
* Enhance Minimum sum partition problem implementation

* Linter resolved

* Linter resolved

* Code review comments

* Code review comments

* Add validation for non-negative numbers

* Linter resolved

* style: fix formiatting

---------

Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees

@Manan-09 Manan-09

Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

Successfully merging a pull request may close this issue.

#4387 Enhance Minimum sum partition problem implementation Manan-09/TheAlgorithms-Java
1 participant
@Manan-09