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 — 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.
What Is Backtracking?
Backtracking is a recursive algorithm that explores all possible solutions by making a choice, recursing forward, and then undoing the choice (backtracking) if it leads to a dead end or an invalid state.
The key insight: backtracking is like exploring a maze. At each junction, you pick a path. If you reach a dead end, you return to the last junction and try a different path. This "try and undo" is the defining characteristic of backtracking.
Example 1 — Subsets (All Subsets of an Array)
Example
def subsets(nums):
"""Generate all 2ⁿ subsets."""
result = []
def backtrack(start, current):
result.append(list(current)) # Every state is a valid subset
for i in range(start, len(nums)):
current.append(nums[i]) # CHOOSE
backtrack(i + 1, current) # EXPLORE
current.pop() # UNDO
backtrack(0, [])
return result
print(subsets([1,2,3]))
# [[], [1], [1,2], [1,2,3], [1,3], [2], [2,3], [3]]
Decision tree:
| Choose 1 | backtrack(1, [1]) |
| Choose 2 | backtrack(2, [1,2]) |
| Choose 3: backtrack(3, [1,2,3]) | save [1,2,3] |
| Undo 2 | save [1,2] |
| Choose 3: backtrack(3, [1,3]) | save [1,3] |
| Undo 1 | save [1] |
| Choose 2 | backtrack(2, [2]) |
Example 2 — Combination Sum
Problem: Find all combinations from candidates that sum to target. Can reuse elements.
Example
def combination_sum(candidates, target):
"""Find all combinations summing to target. Reuse allowed."""
result = []
candidates.sort()
def backtrack(remaining, start, current):
if remaining == 0:
result.append(list(current)) # Found valid combination
return
for i in range(start, len(candidates)):
if candidates[i] > remaining:
break # PRUNE: larger candidates can't help
current.append(candidates[i]) # CHOOSE
backtrack(remaining - candidates[i], i, current) # EXPLORE (i not i+1 = reuse)
current.pop() # UNDO
backtrack(target, 0, [])
return result
print(combination_sum([2,3,6,7], 7))
# [[2,2,3], [7]]
Example 3 — N-Queens
Problem: Place N queens on an N×N chessboard so no two queens attack each other.
Example
def solve_n_queens(n):
"""Place N non-attacking queens on N×N board."""
solutions = []
queens = [] # queens[row] = column where queen is placed in that row
def is_safe(row, col):
for r in range(row):
c = queens[r]
if c == col: return False # Same column
if abs(r - row) == abs(c - col): return False # Same diagonal
return True
def backtrack(row):
if row == n:
# Convert queens array to board representation
board = []
for r in range(n):
board.append('.' * queens[r] + 'Q' + '.' * (n - queens[r] - 1))
solutions.append(board)
return
for col in range(n):
if is_safe(row, col):
queens.append(col) # CHOOSE
backtrack(row + 1) # EXPLORE
queens.pop() # UNDO
backtrack(0)
return solutions
print(f"N=4: {len(solve_n_queens(4))} solutions") # 2 solutions
Example 4 — Sudoku Solver
Example
def solve_sudoku(board):
"""Solve a 9×9 Sudoku puzzle in-place."""
def is_valid(row, col, num):
num_str = str(num)
# Check row
if num_str in board[row]: return False
# Check column
if any(board[r][col] == num_str for r in range(9)): return False
# Check 3×3 box
box_row, box_col = 3 * (row // 3), 3 * (col // 3)
for r in range(box_row, box_row + 3):
for c in range(box_col, box_col + 3):
if board[r][c] == num_str: return False
return True
def backtrack():
for i in range(9):
for j in range(9):
if board[i][j] == '.':
for num in range(1, 10):
if is_valid(i, j, num):
board[i][j] = str(num) # CHOOSE
if backtrack(): return True # EXPLORE
board[i][j] = '.' # UNDO
return False # No valid number found → backtrack
return True # All cells filled
backtrack()
Pruning — Making Backtracking Efficient
Without pruning, backtracking explores all possible states. Pruning cuts branches that cannot lead to valid solutions:
Example
# Without pruning: tries all possibilities
def subsets_no_prune(nums, start=0, current=[]):
yield list(current)
for i in range(start, len(nums)):
current.append(nums[i])
yield from subsets_no_prune(nums, i+1, current)
current.pop()
# With pruning: for combination sum, stop when sum exceeds target
def combination_sum_pruned(candidates, target):
candidates.sort() # Enables pruning: break when candidate > remaining
result = []
def backtrack(remaining, start, current):
if remaining == 0:
result.append(list(current))
return
for i in range(start, len(candidates)):
if candidates[i] > remaining:
break # ← PRUNE: all subsequent candidates are even larger
current.append(candidates[i])
backtrack(remaining - candidates[i], i, current)
current.pop()
backtrack(target, 0, [])
return result
Complexity of Backtracking
Backtracking is exponential in the worst case, but pruning can dramatically reduce actual runtime.
| Problem | Worst Case | With Pruning |
|---|---|---|
| Subsets | O(2ⁿ) | O(2ⁿ) (must enumerate all) |
| Permutations | O(n!) | O(n!) (must enumerate all) |
| N-Queens | O(n!) | ~O(n!) but much better in practice |
| Sudoku | O(9^81) | O(1) to O(9^81) depending on puzzle |
| Combination Sum | O(2^t) | Much less with sorted + break |
Summary
Backtracking = recursion + "undo" on backtrack:
- Choose: Make a decision at the current step
- Explore: Recurse with the new state
- Undo: Remove the choice (restore previous state)
- Prune: Skip invalid or unpromising choices early
Template applies to:
- Finding all solutions (permutations, subsets, combinations)
- Constraint satisfaction (N-Queens, Sudoku, crossword)
- Path finding in graphs with constraints
*Recursion folder complete. Next: Searching — Linear Search*
Continue the lesson path
Study next in this module
01RecursionRecursion Basics — The Complete BeginnerMaster recursion from the ground up — what recursion is, how the call stack works, the three laws of recursion, base cases and recursive cases, common recursion patterns, visualizing recursion trees, and avoiding infinite recursion and stack overflow.02RecursionRecursion Problems — 12 Classic Problems from Basic to AdvancedSolve 12 classic recursion problems — Tower of Hanoi, string permutations, power set, balanced parentheses, palindrome check, climbing stairs, flood fill, binary search, merge sort, tree problems, and staircase with k steps.03RecursionRecursion Tree — Visualizing Recursion for Complexity AnalysisLearn how to draw and analyze recursion trees — the most intuitive method for understanding recursive algorithm complexity. Covers single and multi-branch recursion, level-by-level work calculation, geometric series sums, and how recursion trees explain Merge Sort, Fibonacci, and divide-and-conquer algorithms.04RecursionRecursion vs Iteration — When to Use Each and How to ConvertA complete comparison of recursion and iteration — performance differences, space implications, readability tradeoffs, conversion patterns, and a guide for choosing the right approach for tree traversals, search, sorting, and dynamic programming.