Skip to content

Algorithms for Competitive Programming

Code of conduct

Initializing search

Home
Algebra
Data Structures
Dynamic Programming
String Processing
Linear Algebra
Combinatorics
Numerical Methods
Geometry
Graphs
Miscellaneous

Algorithms for Competitive Programming

Home
Home
Algebra
Algebra
- Fundamentals
  Fundamentals
- Prime numbers
  Prime numbers
- Number-theoretic functions
  Number-theoretic functions
  - Euler's totient function
  - Number of divisors / sum of divisors
- Modular arithmetic
  Modular arithmetic
- Number systems
  Number systems
  - Balanced Ternary
  - Gray code
- Miscellaneous
  Miscellaneous
Data Structures
Data Structures
- Fundamentals
  Fundamentals
  - Minimum Stack / Minimum Queue
  - Sparse Table
- Trees
  Trees
- Advanced
  Advanced
  - Deleting from a data structure in O(T(n) log n)
Dynamic Programming
Dynamic Programming
- DP optimizations
  DP optimizations
  - Divide and Conquer DP
  - Knuth's Optimization
- Tasks
  Tasks
  - Dynamic Programming on Broken Profile. Problem "Parquet"
  - Finding the largest zero submatrix
String Processing
String Processing
- Fundamentals
  Fundamentals
- Advanced
  Advanced
- Tasks
  Tasks
Linear Algebra
Linear Algebra
- Matrices
  Matrices
Combinatorics
Combinatorics
- Fundamentals
  Fundamentals
- Techniques
  Techniques
- Tasks
  Tasks
Numerical Methods
Numerical Methods
- Search
  Search
- Integration
  Integration
  - Integration by Simpson's formula
Geometry
Geometry
- Elementary operations
  Elementary operations
- Polygons
  Polygons
- Convex hull
  Convex hull
  - Convex hull construction
  - Convex hull trick and Li Chao tree
- Sweep-line
  Sweep-line
  - Search for a pair of intersecting segments
  - Point location in O(log N)
- Miscellaneous
  Miscellaneous
Graphs
Graphs
- Graph traversal
  Graph traversal
  - Breadth First Search
  - Depth First Search
- Connected components, bridges, articulations points
  Connected components, bridges, articulations points
- Single-source shortest paths
  Single-source shortest paths
- All-pairs shortest paths
  All-pairs shortest paths
  - Floyd-Warshall - finding all shortest paths
  - Number of paths of fixed length / Shortest paths of fixed length
- Spanning trees
  Spanning trees
- Cycles
  Cycles
- Lowest common ancestor
  Lowest common ancestor
- Flows and related problems
  Flows and related problems
- Matchings and related problems
  Matchings and related problems
  - Bipartite Graph Check
  - Kuhn's Algorithm - Maximum Bipartite Matching
- Miscellaneous
  Miscellaneous
Miscellaneous
Miscellaneous
- Sequences
  Sequences
- Game Theory
  Game Theory
  - Games on arbitrary graphs
  - Sprague-Grundy theorem. Nim
- Schedules
  Schedules
- Miscellaneous
  Miscellaneous

December 13, 2022

Code of conduct

We endorse and follow the code of conduct of the International Olympiad of Informatics, available at the IOI website.

Contributors:

adamant-pwn (100.0%)

Text is available under the Creative Commons Attribution Share Alike 4.0 International License
Copyright © 2014 - 2022 by https://github.com/cp-algorithms

Made with Material for MkDocs