DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master backtracking from the ground up — what backtracking is, how it differs from brute force, the universal backtracking template, state space tree visualization, pruning strategies that make backtracking efficient, and when to apply backtracking versus dynamic programming.
What Is Backtracking?
Backtracking is an algorithmic technique that considers searching every possible combination in order to solve a computational problem. It incrementally builds candidates for a solution and abandons (backtracks from) each partial candidate as soon as it determines that this candidate cannot lead to a valid complete solution.
The word backtrack literally means to go back the way you came — reversing a decision that turned out to be wrong and trying a different path.
The central idea: At each decision point, make one choice, proceed forward, and if you reach a dead end, undo that choice and try the next option. This "try and undo" cycle is what separates backtracking from simple recursion.
The State Space Tree
Every backtracking problem can be visualized as a state space tree — a tree where:
- The root represents the initial empty state
- Each edge represents one decision/choice
- Each node represents a partial solution (state)
- Leaf nodes represent complete solutions (or dead ends)
Example
Finding all 3-letter sequences from {A, B, C} with no repeats:
ROOT (empty)
/ | \
A B C
/ \ / \ / \
AB AC BA BC CA CB
/ \ / \ / \
ABC ACB BAC BCA CAB CBA
✓ ✓ ✓ ✓ ✓ ✓
Without backtracking: explore ALL paths
With backtracking + pruning: skip dead-end paths early
The Universal Backtracking Template
Every backtracking solution follows this exact pattern:
Example
def backtrack(state, choices, result):
"""
Universal backtracking template.
Parameters:
state: Current partial solution (what we've built so far)
choices: Available decisions at current step
result: Collection to store complete valid solutions
"""
# ── STEP 1: Base case — is the current state a complete solution? ──────
if is_complete(state):
result.append(copy_of(state)) # Save this solution
return # Don't go further
# ── STEP 2: Try each available choice ─────────────────────────────────
for choice in get_available_choices(state, choices):
# ── STEP 3: Pruning — is this choice valid/promising? ─────────────
if not is_valid(state, choice):
continue # Skip invalid choices early
# ── STEP 4: CHOOSE — make the decision ────────────────────────────
make_choice(state, choice)
# ── STEP 5: EXPLORE — recurse with updated state ──────────────────
backtrack(state, remaining_choices(choices, choice), result)
# ── STEP 6: UNDO — reverse the decision (backtrack) ───────────────
undo_choice(state, choice)
The three key actions are always:
- Choose — Make a decision, modify the state
- Explore — Recurse to explore the consequences
- Undo — Reverse the decision, restore previous state
First Complete Example — Generate All Permutations
Example
def permutations(nums):
"""
Generate all permutations of nums using backtracking.
Time: O(n! × n), Space: O(n)
"""
result = []
def backtrack(current, remaining):
# Base case: permutation is complete
if not remaining:
result.append(list(current))
return
for i in range(len(remaining)):
# CHOOSE: Add remaining[i] to current permutation
current.append(remaining[i])
# EXPLORE: Build the rest of the permutation
new_remaining = remaining[:i] + remaining[i+1:]
backtrack(current, new_remaining)
# UNDO: Remove remaining[i] (backtrack)
current.pop()
backtrack([], nums)
return result
print(permutations([1, 2, 3]))
# [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
Decision tree for [1,2,3]:
| Start | [] |
| Choose 1 | [1] |
| Choose 2 | [1,2] |
| Choose 3: [1,2,3] | COMPLETE ✓ |
| Choose 3 | [1,3] |
| Choose 2: [1,3,2] | COMPLETE ✓ |
| Choose 2 | [2] |
| Choose 1 | [2,1] |
| Choose 3: [2,1,3] | COMPLETE ✓ |
Second Example — Generate All Subsets
Example
def subsets(nums):
"""
Generate all 2^n subsets using backtracking.
At each index, decide: include or exclude nums[index].
"""
result = []
def backtrack(start, current):
# Every state is a valid subset (not just leaves)
result.append(list(current))
for i in range(start, len(nums)):
# CHOOSE: Include nums[i]
current.append(nums[i])
# EXPLORE: Consider elements after nums[i]
backtrack(i + 1, current)
# UNDO: Exclude nums[i]
current.pop()
backtrack(0, [])
return result
print(subsets([1, 2, 3]))
# [[], [1], [1,2], [1,2,3], [1,3], [2], [2,3], [3]]
Pruning — The Heart of Efficiency
Without pruning, backtracking degenerates to exhaustive brute force. Pruning eliminates branches of the state space tree that cannot lead to valid solutions.
Example — Combination Sum with Pruning
Example
def combination_sum(candidates, target):
"""
Find all combinations that sum to target.
Pruning: if current sum exceeds target, stop exploring.
"""
candidates.sort() # Sort enables effective pruning
result = []
def backtrack(start, current, remaining):
if remaining == 0:
result.append(list(current))
return
for i in range(start, len(candidates)):
# PRUNING: If candidate exceeds remaining, all further will too
if candidates[i] > remaining:
break # ← This single line eliminates entire branches!
# CHOOSE
current.append(candidates[i])
# EXPLORE (i not i+1 — can reuse same element)
backtrack(i, current, remaining - candidates[i])
# UNDO
current.pop()
backtrack(0, [], target)
return result
print(combination_sum([2, 3, 6, 7], 7))
# [[2,2,3], [7]]
Without the break (no pruning): Explores all 4^(target/min) combinations With the break (pruning): Eliminates all branches where sum would exceed target
Backtracking vs Dynamic Programming
Both solve optimization and enumeration problems, but they're suited for different scenarios:
| Aspect | Backtracking | Dynamic Programming |
|---|---|---|
| Goal | Find all solutions / any valid solution | Find optimal solution |
| Subproblems | Non-overlapping | Overlapping |
| Memory | O(depth) stack space | O(states) table |
| When to use | Constraint satisfaction, enumeration | Optimization with optimal substructure |
| Examples | N-Queens, Sudoku, permutations | Fibonacci, knapsack, LCS |
Rule of thumb: If the problem says "find all solutions" or "is there any valid configuration?" → backtracking. If it says "find the minimum/maximum" → try DP first.
Time Complexity of Backtracking
Backtracking is inherently exponential in the worst case, but pruning reduces actual runtime significantly.
| Problem | Find all permutations of n elements |
| Without pruning | O(n!) — must generate all permutations |
| With pruning | O(n!) — pruning doesn't help for permutations |
| Problem | N-Queens |
| Without pruning | O(n^n) — place queen anywhere in each row |
| With column+diagonal pruning | O(n!) / further optimization ≈ O(n! / e) |
| Problem | Subset Sum |
| Without pruning | O(2^n) — all subsets |
| With sum-based pruning on sorted array | much less in practice |
The general formula for backtracking complexity:
| For permutations | n × (n-1) × (n-2) × ... × 1 = n! |
| For subsets | 2 choices per element = 2^n |
| For Sudoku | up to 9 choices per cell = 9^81 (but pruning reduces this enormously) |
When to Recognize a Backtracking Problem
Look for these keywords in a problem:
- "Find ALL solutions / combinations / permutations"
- "Is there ANY valid arrangement?"
- "Generate all possible..."
- "Can the puzzle be solved?"
- "Find one valid configuration"
Classic backtracking problems:
- N-Queens (place queens without attacking)
- Sudoku solver
- Word search in a 2D grid
- Generating all subsets, permutations, combinations
- Graph coloring
- Crossword puzzle solving
- Constraint satisfaction problems
Common Mistakes in Backtracking
Mistake 1 — Forgetting to Undo the Choice
Example
# WRONG — state is never restored
def wrong_backtrack(current, remaining):
for item in remaining:
current.append(item) # Choose
wrong_backtrack(current, [x for x in remaining if x != item])
# MISSING: current.pop() ← BUG! State corrupts subsequent calls
# CORRECT
def correct_backtrack(current, remaining):
for item in remaining:
current.append(item) # Choose
correct_backtrack(current, [x for x in remaining if x != item])
current.pop() # Undo — ALWAYS needed
Mistake 2 — Not Copying the Solution Before Saving
Example
# WRONG — saves a reference to current (which gets modified)
result.append(current) # This list will be emptied later!
# CORRECT — save a copy
result.append(list(current)) # Copy the current state
result.append(current[:]) # Alternative: slice copy
Mistake 3 — Missing Base Case
python example
# Will recurse forever:
def backtrack(state):
for choice in choices:
make_choice(state, choice)
backtrack(state) # Never stops!
undo_choice(state, choice)
# Always define when to stop:
def backtrack(state):
if is_complete(state): # ← Base case
result.append(copy(state))
return
for choice in choices:
make_choice(state, choice)
backtrack(state)
undo_choice(state, choice)Summary
Backtracking is the systematic method of exploring all possibilities by:
- Building solutions incrementally (one piece at a time)
- Exploring each option through recursion
- Undoing choices when they lead to dead ends
- Pruning invalid branches early for efficiency
The three-step pattern — Choose → Explore → Undo — appears in every backtracking solution. Master this pattern and you can solve any backtracking problem.
Backtracking is the right choice when:
- You need all solutions (not just one optimal one)
- The problem involves constraint satisfaction
- Brute force would work but is too slow (pruning helps)
- The problem is a classic "grid puzzle" or "arrangement" type
*Next Lesson: N-Queens Problem*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Backtracking — The Complete Guide to Recursive Exploration with Undo.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, backtracking, introduction, backtracking — the complete guide to recursive exploration with undo
Related Data Structures & Algorithms Topics
Continue learning this concept
BacktrackingBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsSolve 12 classic backtracking interview problems — word search, letter combinations of phone number, palindrome partitioning, restore IP addresses, permutations II with duplicates, combination sum II, beautiful arrangements, word break II, expression add operators, and more.BacktrackingN-Queens Problem — Complete Solution with Backtracking and OptimizationMaster the N-Queens problem completely — problem definition, why queens attack each other, step-by-step backtracking solution, constraint checking using column and diagonal sets, optimized solution with bitmasks, counting total solutions, and visualizing the complete search tree.BacktrackingRat in a Maze — Backtracking Path Finding with All SolutionsMaster the Rat in a Maze problem — finding all paths from source to destination in a binary grid, backtracking with visited tracking, directional movement (4-directional and 8-directional), finding shortest path, path reconstruction, and variations including multiple exit points.BacktrackingSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingMaster subset generation with backtracking — generating all 2^n subsets, subsets with duplicates, combinations of size k, combination sum, partitions, power set using bitmask approach, and understanding which problems require subsets versus combinations versus permutations.BacktrackingSudoku Solver — Backtracking with Constraint PropagationMaster Sudoku solving with backtracking — the rules of Sudoku, basic backtracking solver, O(1) validity checking with sets, naked singles optimization, constraint propagation, forward checking, and how to build an efficient solver that handles even hard Sudoku puzzles.RecursionBacktracking Introduction — The Recursive Exploration with UndoMaster backtracking — the algorithmic technique for finding all solutions by recursively exploring choices and undoing them when they lead to dead ends. Learn the backtracking template, pruning strategies, and classic examples: N-Queens, Sudoku solver, and combination sum.