Algorithms and data structures for competitive programming

• Dynamic Programming
• Data Structures
  • Segment Tree
  • Union Find
• Graphs
  • Topological Sorting
  • Minimum Spaning Tree (Kruskal)
  • Dijkstra
  • Floyd-Warshall
  • Bipartite verification
  • LCA via Binary Lifting
  • Tarjan - Strong Connected Components (SCCs)
• Math
  • Basic Math
  • Number Theory
    • Binary Exp
    • Get dividers
    • Prime factorization
    • Sieve of Eratosthenes
• Strings
  • Z function

Topics to study and implement later:

• Binary exponentiation
• Union Find
• Z algorithm / KMP
• Binary lifting / LCA
• Functional graphs
• Tarjan
• Dp w/ bitmask
• Expected value
• Inclusion-Exclusion principle
• Segment trees: Lazy propagation, sparse tree, persistent, dynamic, segtree beats etc
• Max flow min cut
• Bridges and articulation points
• Cycle detection
• Euler Tour
• Matrix exponentiation
• Euler path
• Suffix Array
• HLD
• Centroid Decomposition
• FFT
• Sweep Line
• Treaps