DSA
brute force
try all possibilities (correct baseline)
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)
- constraint satisfactionfind an assignment meeting all rules (backtracking)
- 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