Implementations of Algorithms and Data Structures for Competitive Programming

This is a list of algorithm and data structure implementations that can be used in competitive programming. This list is by no means exhaustive. It will grow to contain other implementations.

Data Structures

• Fenwick Trees
• Splay Trees

Graph Theory

• Lowest Common Ancestors with Binary Jumping
• Union-Find (Maintaining Disjoint Sets under Union)
• Classifying Edges in a Graph with Depth First Search
• Maximum Flow in a Flow Network

Number Theory

• Efficient Prime Factorization after Sieve
• Efficient Computation of Modular Multiplicative Inverses with (Pre-processing)

Strings and Sequences

• Longest Increasing Subsequence with Patience Sort
• Aho-Corasick
• Suffix Sort