Guide

• Acknowledgments
• Preface
• Fundamentals
  • Input and Output
  • Complexity
  • First Problems
    • Bessie's Candles
    • Froyo
  • Sorting
    • Insertion Sort
    • Merge Sort
    • Quicksort
    • Ms. Manana's Puzzles
• Big Ideas
  • Brute Force
    • Square Root
    • Combination Lock
    • Ski Course Design
    • Contest Practice
  • Depth-First Search (DFS)
    • Permutations
    • Basketball
    • Problem Break
    • Generalizing DFS
    • Dungeon
    • n Queens Puzzle
  • Greedy Algorithms
    • Bessie the Polyglot
    • More Cowbell
    • Farmer John and Boxes
    • Snack Time
• Standard Library Data Structures
  • Generics
  • List
    • Dynamic Array
    • Linked List
  • Stack
  • Queue
  • Heap
  • Set
    • Binary Search Tree
    • Hash Table
  • Map
• Graph Algorithms
  • Connected Components
    • Flood Fill
    • Union-Find (Disjoint Set Union)
  • Shortest Path
    • Dijkstra
    • Floyd-Warshall
    • Bellman-Ford
  • Minimum Spanning Tree
    • Prim
    • Kruskal
  • Eulerian Tour
• Complex Ideas and Data Structures
  • Dynamic Programming over Subsets (n2n DP)
  • n Bucketing
  • Segment Tree
    • Lazy Propagation
    • Fenwick Tree
  • Queue with Minimum Query
  • Balanced Binary Search Tree
    • Treap
    • Tree Rotation
    • Splay Tree
    • Red-Black Tree
• Computational Geometry
  • Basic Tools
  • Formulas
    • Area
    • Distance
    • Configuration
    • Intersection
  • Convex Hull
  • Sweep Line
• Tree Algorithms
  • DFS on Trees
  • Jump Pointers
  • Euler Tour Technique
    • Euler Tour Tree
  • Heavy-Light Decomposition
  • Link-Cut Tree
• Strings
  • String Hashing
  • Knuth-Morris-Pratt
  • Trie
  • Suffix Array
  • Aho-Corasick
  • Advanced Suffix Data Structures
    • Suffix Tree
    • Suffix Automaton
• More Graph Algorithms
  • Strongly Connected Components
  • Network Flow
    • Ford-Fulkerson
    • Max-Flow Min-Cut Theorem
    • Refinements of Ford-Fulkerson
    • Push-Relabel
    • Extensions
    • Bipartite Matchings
• Math
  • Number Theory
    • Random Prime Numbers Bounds
    • Prime Number Testing
    • Sieve of Eratosthenes
    • Prime Factorization
    • GCD and the Euclidean Algorithm
    • Fermat's Little Theorem
    • Modular Inverses
  • Combinatorial Games
  • Karatsuba
  • Matrices
  • Fast Fourier Transform
• Nonsense
  • Segment Tree Extensions
    • Fractional Cascading
    • Persistence
    • Higher Dimensions
  • DP Optimizations
  • Top Tree
  • Link-Cut Cactus
• Problems
  • Bronze
  • Silver
    • Complete Search
    • Greedy
    • Standard Dynamic Programming
    • Standard Graph Theory
    • Easy Computational Geometry
  • Gold
    • More Dynamic Programming
    • Binary Search
    • Segment Tree
    • More Standard Graph Theory
    • Standard Computational Geometry
    • Less Standard Problems
  • Beyond
    • Data Structure Nonsense
    • Other Nonsense