DSA
constraint satisfaction
find an assignment meeting all rules (backtracking)
Source board
This definition comes from the board below. Open it to see the term in context.
Algorithm Design PatternsDSAMore terms from this board
- backtrackingincremental build + prune dead branches (DFS over solutions)
- brute forcetry all possibilities (correct baseline)
- divide & conquersplit/solve/combine
- exchange argumentthe proof technique that a greedy choice is safe
- pruningcutting a branch that can't succeed
- the meta-methodbrute force → find bottleneck → apply the pattern that removes it → verify