[FEATURE REQUEST] Backtracking algorithms (All combinations)

[TheClerici]

What would you like to Propose?

I would like to add the all combinations algorithm!

Issue details

Although it is already in another repository from the Algorithms group (Python), I was unable to locate it in the folders (Java).

Additional Information

In this problem, we want to determine all possible combinations of k numbers out of 1 ... n. We use backtracking to solve this problem.

• Example:

generate_all_combinations(n=4, k=2)
[[1, 2], [1, 3], [1, 4], [2, 3], [2, 4], [3, 4]]

[siriak]

I think that's what you are looking for https://github.com/TheAlgorithms/Java/blob/b6563cf37ae7db33e3f3c8ad513acd905353c147/src/main/java/com/thealgorithms/backtracking/Combination.java

[TheClerici]

It is a little bit different, as the one you send is the combination in an array, and in this situation is from 1...n

[TheClerici]

This is the sister repository with the problem I'm talking about, https://github.com/TheAlgorithms/Python/blob/master/backtracking/all_combinations.py lmk to start it!

[siriak]

You could just create a function that creates an array with values from 1 to n and calls the already implemented combination function, right? Feel free to do that and I'll review

[TheClerici]

Sure, I can do that

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!

[BamaCharanChhandogi]

Hey @siriak , Please check this PR #4156

[TheClerici]

Hello @BamaCharanChhandogi, this PR is already closed as I added a solution for it, I am not a reviewer, I think with that siriak can help out!