Backtracking

Pro

Backtracking is essentially brute force and should be used only when we need to generate all solutions. It should only be used when more efficient approaches such as greedy algorithms and dynamic programming cannot be used.

Keywords for identifying Backtracking Problems

→ Find all possible …
→ Find any such that …
→ Count total number that …
→ Determine if a solution exists …
→ Find the best solution to …
→ Permutation/Combination problem …

Unlock the Backtracking template

Get the full code template and worked LeetCode examples for Backtracking — plus every other pattern in the library — with a one-time $29 lifetime upgrade.

Upgrade to Pro See free Binary Search template →