-
-
Notifications
You must be signed in to change notification settings - Fork 7.4k
feat: Added Solution of Partition Problem #1842
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.
Awesome work! 🚀
Co-authored-by: David Leal <[email protected]>
Co-authored-by: David Leal <[email protected]>
a152bf7
to
6a3fb64
Compare
6a3fb64
to
8e2770b
Compare
Co-authored-by: David Leal <[email protected]>
Co-authored-by: David Leal <[email protected]>
Co-authored-by: David Leal <[email protected]>
1c05711
to
e3f2cda
Compare
Co-authored-by: David Leal <[email protected]>
Co-authored-by: David Leal <[email protected]>
baf20a6
to
d8c61b2
Compare
Co-authored-by: David Leal <[email protected]>
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.
Awesome work! 🚀 Thanks so much for your contribution! 😄👍
Will merge for now. If any of you (@Amino19, @ayaankhan98, @mishraabhinn, or anyone else) have any objections, please comment here and make a separate PR to fix that. Thank you. 🙂 |
Description of Change
Partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same.
Checklist
Notes: This implementation has dynamic programming in it with the time complexity of O(sum*n) and space complexity of O(sum*n) where sum is the sum of all the elements of vector