Backtracking
Exploring choices and undoing the ones that fail.
1 subject · 2 topics · 1 cheatsheet
Subjects covering this category
1 subject- Subject · Intermediate to Advanced
Tracing, implementing and proving the cost of the classic searching, sorting and graph algorithms, and designing new ones with divide and conquer, backtracking, greedy choice and dynamic programming, in Python, Java and TypeScript.
- Searching and Simple Sorting
- Efficient Sorting
- Design Strategies
Cheatsheets
1 cheatsheet- Cheatsheet · Algorithms
Backtracking, greedy algorithms and dynamic programming on one page: when each fits, and the Python that shows its shape.
In Backtracking itself
2 topics- Algorithms
Backtracking: building every candidate solution one choice at a time, undoing each choice, and pruning branches that cannot succeed.
Intermediate to Advanced9 cards · 4 qnot started
- Algorithms
Choosing between divide and conquer, dynamic programming, greedy and backtracking in algorithms, by how a problem's subproblems behave.
Intermediate to Advanced7 cards · 3 qnot started