Repository navigation
Backtracking Algorithms #945
Description
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).
Metadata
Metadata
Assignees
Labels
No labels
Activity
[-]Back Tracking Algorithms[/-][+]Backtracking Algorithms[/+]Erfaniaa commentedon Jul 4, 2019
Does anyone agree?
Personally, I agree with n-queens and m-coloring.
@poyea @AnupKumarPanwar @himangSharatun @dynamitechetan @nikit19 @jogendra
hetzz commentedon Jul 4, 2019
PR: #953
poyea commentedon Jul 4, 2019
I'm okay with this. I've approved #953 and will let it be there for a moment. I'll merge it very soon.
poyea commentedon Jul 4, 2019
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.
#945 Backtracking Algorithms (#953)
jai-dewani commentedon Aug 30, 2019
What about "Crossword problem", it is also a Backtracking problem?
github-actions commentedon Nov 29, 2019
Stale issue message
TheAlgorithms#945 Backtracking Algorithms (TheAlgorithms#953)