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 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.
Sudoku Rules
A 9×9 grid divided into nine 3×3 boxes. Fill in digits 1-9 such that:
- Each row contains digits 1-9, each exactly once
- Each column contains digits 1-9, each exactly once
- Each 3×3 box contains digits 1-9, each exactly once
Example
Input (0 = empty cell):
5 3 0 | 0 7 0 | 0 0 0
6 0 0 | 1 9 5 | 0 0 0
0 9 8 | 0 0 0 | 0 6 0
------+-------+------
8 0 0 | 0 6 0 | 0 0 3
4 0 0 | 8 0 3 | 0 0 1
7 0 0 | 0 2 0 | 0 0 6
------+-------+------
0 6 0 | 0 0 0 | 2 8 0
0 0 0 | 4 1 9 | 0 0 5
0 0 0 | 0 8 0 | 0 7 9
Solution 2 — Optimized with Sets: O(1) Validity Check
Example
def solve_sudoku_fast(board):
"""
Optimized: maintain sets for rows, columns, and boxes.
Validity check becomes O(1) instead of O(9).
"""
# Initialize constraint sets from existing numbers
rows = [set() for _ in range(9)]
cols = [set() for _ in range(9)]
boxes = [set() for _ in range(9)] # Box index = (row//3)*3 + col//3
empty_cells = []
for r in range(9):
for c in range(9):
val = board[r][c]
box_idx = (r // 3) * 3 + (c // 3)
if val != 0:
rows[r].add(val)
cols[c].add(val)
boxes[box_idx].add(val)
else:
empty_cells.append((r, c))
def is_valid(r, c, num):
"""O(1) validity check using sets."""
box_idx = (r // 3) * 3 + (c // 3)
return num not in rows[r] and num not in cols[c] and num not in boxes[box_idx]
def backtrack(idx):
if idx == len(empty_cells):
return True # All cells filled
r, c = empty_cells[idx]
box_idx = (r // 3) * 3 + (c // 3)
for num in range(1, 10):
if is_valid(r, c, num):
# CHOOSE: Place num
board[r][c] = num
rows[r].add(num)
cols[c].add(num)
boxes[box_idx].add(num)
# EXPLORE
if backtrack(idx + 1):
return True
# UNDO: Remove num
board[r][c] = 0
rows[r].remove(num)
cols[c].remove(num)
boxes[box_idx].remove(num)
return False # No digit works → backtrack
return backtrack(0)
Solution 3 — Minimum Remaining Values (MRV) Heuristic
Idea: Instead of trying cells in order (left to right, top to bottom), always try the cell with the fewest valid options first. This dramatically reduces backtracking.
Example
def solve_sudoku_mrv(board):
"""
MRV (Minimum Remaining Values) heuristic:
Always fill the cell with fewest valid choices first.
This often solves hard Sudoku without any backtracking.
"""
rows = [set() for _ in range(9)]
cols = [set() for _ in range(9)]
boxes = [set() for _ in range(9)]
for r in range(9):
for c in range(9):
val = board[r][c]
if val != 0:
box = (r//3)*3 + c//3
rows[r].add(val); cols[c].add(val); boxes[box].add(val)
def get_candidates(r, c):
"""Get set of valid digits for cell (r, c)."""
box = (r//3)*3 + c//3
used = rows[r] | cols[c] | boxes[box]
return set(range(1, 10)) - used
def find_best_cell():
"""Find empty cell with minimum candidates (MRV)."""
best_r, best_c, best_cands = None, None, set(range(1, 11))
for r in range(9):
for c in range(9):
if board[r][c] == 0:
cands = get_candidates(r, c)
if len(cands) < len(best_cands):
best_r, best_c, best_cands = r, c, cands
return best_r, best_c, best_cands
def backtrack():
r, c, candidates = find_best_cell()
if r is None:
return True # No empty cells left — solved!
if not candidates:
return False # Cell has no valid options — backtrack
box = (r//3)*3 + c//3
for num in candidates:
board[r][c] = num
rows[r].add(num); cols[c].add(num); boxes[box].add(num)
if backtrack():
return True
board[r][c] = 0
rows[r].remove(num); cols[c].remove(num); boxes[box].remove(num)
return False
return backtrack()
Constraint Propagation — Naked Singles
Naked singles: If a cell has only one valid candidate, it MUST be that number. Propagate this constraint before backtracking.
Example
def naked_singles_propagation(board, rows, cols, boxes):
"""
Repeatedly fill cells with only one valid option.
Returns False if a contradiction is found.
Returns number of cells filled.
"""
filled = 0
changed = True
while changed:
changed = False
for r in range(9):
for c in range(9):
if board[r][c] == 0:
box = (r//3)*3 + c//3
candidates = set(range(1,10)) - rows[r] - cols[c] - boxes[box]
if len(candidates) == 0:
return -1 # Contradiction — no valid options!
if len(candidates) == 1:
num = candidates.pop()
board[r][c] = num
rows[r].add(num); cols[c].add(num); boxes[box].add(num)
filled += 1
changed = True
return filled
Complete Solver with All Optimizations
Example
def solve_sudoku_complete(board):
"""
Full-featured solver: naked singles + MRV + backtracking.
Can solve any valid 9×9 Sudoku.
"""
rows = [set() for _ in range(9)]
cols = [set() for _ in range(9)]
boxes = [set() for _ in range(9)]
for r in range(9):
for c in range(9):
val = board[r][c]
if val != 0:
box = (r//3)*3 + c//3
rows[r].add(val); cols[c].add(val); boxes[box].add(val)
def get_candidates(r, c):
box = (r//3)*3 + c//3
return set(range(1,10)) - rows[r] - cols[c] - boxes[box]
def find_mrv_cell():
best = None
for r in range(9):
for c in range(9):
if board[r][c] == 0:
cands = get_candidates(r, c)
if not cands: return r, c, set() # Contradiction
if best is None or len(cands) < len(best[2]):
best = (r, c, cands)
return best if best else (None, None, None)
def backtrack():
r, c, cands = find_mrv_cell()
if r is None: return True # Solved
if not cands: return False # Contradiction
box = (r//3)*3 + c//3
for num in sorted(cands): # Try smallest first
board[r][c] = num
rows[r].add(num); cols[c].add(num); boxes[box].add(num)
if backtrack(): return True
board[r][c] = 0
rows[r].discard(num); cols[c].discard(num); boxes[box].discard(num)
return False
return backtrack()
Testing
Example
def print_board(board):
for r in range(9):
if r % 3 == 0 and r != 0:
print("-" * 21)
row_str = ""
for c in range(9):
if c % 3 == 0 and c != 0:
row_str += "| "
row_str += str(board[r][c]) + " "
print(row_str)
# Famous "hardest Sudoku" — Al Escargot
board = [
[1,0,0,0,0,7,0,9,0],
[0,3,0,0,2,0,0,0,8],
[0,0,9,6,0,0,5,0,0],
[0,0,5,3,0,0,9,0,0],
[0,1,0,0,8,0,0,0,2],
[6,0,0,0,0,4,0,0,0],
[3,0,0,0,0,0,0,1,0],
[0,4,0,0,0,0,0,0,7],
[0,0,7,0,0,0,3,0,0],
]
import copy
b = copy.deepcopy(board)
print("Solving...")
solve_sudoku_complete(b)
print_board(b)
Complexity Analysis
| Approach | Time (worst) | Space | Performance |
|---|---|---|---|
| Basic backtracking | O(9^81) | O(1) | Slow on hard puzzles |
| With sets (O(1) check) | O(9^81) | O(81) | Faster in practice |
| MRV heuristic | O(9^empty_cells) | O(81) | Much faster |
| + Naked singles | Typically O(n²) | O(81) | Near-instant for most |
In practice, combining naked singles propagation with MRV solves 99% of published Sudoku puzzles without any backtracking at all — backtracking is only needed for "evil" difficulty puzzles.
Summary
Sudoku solving demonstrates how backtracking combined with constraint propagation can turn an O(9^81) worst case into a near-instant solution for real inputs:
- Basic backtracking: Try each digit, validate, backtrack if invalid
- Set-based validation: O(1) validity check with row/col/box sets
- MRV heuristic: Fill most constrained cells first to reduce branching
- Naked singles: Propagate cells with only one option before backtracking
- Combined: Near-instant solution for virtually all real Sudoku puzzles
*Next Lesson: Subset Generation*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Sudoku Solver — Backtracking with Constraint Propagation.
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, sudoku, solver
Related Data Structures & Algorithms Topics
Continue learning this concept
BacktrackingBacktracking — The Complete Guide to Recursive Exploration with UndoMaster 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.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.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.