-
-
Notifications
You must be signed in to change notification settings - Fork 193
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
Combinations #381
Labels
enhancement
New feature or request
hacktoberfest-accepted
Hacktoberfest!
help wanted
Extra attention is needed
Projects
Comments
wzhouwzhou
added
enhancement
New feature or request
hacktoberfest-accepted
Hacktoberfest!
labels
Oct 8, 2019
Solved it Please check if changes let me know |
Please see my comments |
kannagikazuko
added a commit
that referenced
this issue
Oct 17, 2019
Solved Issue Combinations #381 as powerset.cpp
Solved it in Javascript. This kind of combination is known as a power set and I found more information about it on wikipedia. It's very inefficient but that's usually the case with complex javascript one-liners. 😄 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Labels
enhancement
New feature or request
hacktoberfest-accepted
Hacktoberfest!
help wanted
Extra attention is needed
You are given an array with random integers. Design an algorithm that returns a list of arrays with all the possible combinations of the numbers in the array.
This means if the input is [1,2,3], the output will be [[1],[2],[3],[12],[13],[23],[123]].
Some solutions might be faster than others but speed does not matter.
The text was updated successfully, but these errors were encountered: