Definition
A general algorithmic technique for finding solutions by incrementally building a candidate solution and abandoning a candidate (‘backtracking’) as soon as it is determined that the candidate cannot possibly be completed to a valid solution.
Why it matters (in Poovi’s context)
Appears in interviews for combinatorial problems, testing the ability to explore solution spaces systematically.
Key properties or components
- Recursive approach
- Explores possible solutions
- Prunes invalid paths
Contradictions or debates
None.