Skip to content
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

Implement Subset Sum algorithm #3

Open
manishrw opened this issue Oct 12, 2018 · 4 comments
Open

Implement Subset Sum algorithm #3

manishrw opened this issue Oct 12, 2018 · 4 comments
Labels
hacktoberfest help wanted

Comments

@manishrw
Copy link
Owner

Given a set of non-negative integers, and a value sum, return if there is a subset of the given set with a sum equal to the given sum. Let me know if you need more details.
@manishrw manishrw changed the title Subset Sum Problem Implement Subset Sum algorithm Oct 12, 2018
@megandsouza03
Copy link

Hey!

Can I take this up? :)

@NeilBotelho
Copy link

NeilBotelho commented Oct 12, 2018 •
edited
Loading

How will the set be given? Can you give a test case?

@eveem eveem mentioned this issue Oct 17, 2018
Open
@manishrw
Copy link
Owner Author

Reference - https://en.wikipedia.org/wiki/Subset_sum_problem
Input: set = [3, 34, 4, 12, 5, 2], sum = 9
Output: True //There is a subset (4, 5) with sum 9.

@NeilBotelho
Copy link

Can i take this up?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
hacktoberfest help wanted
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
3 participants
@manishrw @megandsouza03 @NeilBotelho