-
-
Notifications
You must be signed in to change notification settings - Fork 46.7k
Backtracking Algorithms #945
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
Comments
Does anyone agree? |
PR: #953 |
I'm okay with this. I've approved #953 and will let it be there for a moment. I'll merge it very soon. |
I've heard previously that these problems should not be included, but I think it's fine as long as files are not duplicate/redundant. They could be classical or modern or "interview" type algorithms, but if that's a problem, this should be stated in README, etc. |
* Adding nqueens.py for backtracking * Adding sum_of_subsets.py for backtracking * Update nqueens.py * Rename nqueens.py to n_queens.py * Deleting /other/n_queens.py
What about "Crossword problem", it is also a Backtracking problem? |
Stale issue message |
* Adding nqueens.py for backtracking * Adding sum_of_subsets.py for backtracking * Update nqueens.py * Rename nqueens.py to n_queens.py * Deleting /other/n_queens.py
I would want to add a new directory/folder for problems that can be solved using the backtracking algorithmic-approach. The three problems I would work on are nQueens, Sum of Subsets, m-coloring(Graph).
The text was updated successfully, but these errors were encountered: