KO | EN

GitLite

Minimalist Open Source Repository Search Engine

gitlite — search

#dsh #dsh-plugin #typescript #developer-tools #claude-code #ai-agent #codex #deepseek-harness #ai-agents #cli #react #mcp

competitive-programming

★ 7 Open GitHub ↗

Data structures and algorithms for competitive programming :shipit:

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

![language](https://img.shields.io/badge/language-c++-blue.svg?style=flat)
[![license](https://img.shields.io/github/license/lincolncpp/grape2d.svg)](https://raw.githubusercontent.com/lincolncpp/competitive-programming/master/LICENSE)

# Competitive programming stuffs
Data structures and algorithms for competitive programming.

Note: This is a publish-only repository and all pull requests are ignored.

### Data Structures 
1. - [x] [Fenwick tree](data_structure/bit.cpp)
1. - [x] [Fenwick tree 2D](data_structure/bit2D.cpp)
1. - [x] [Disjoint set union](data_structure/dsu.cpp)
2. - [x] [DSU w/ rollback](data_structure/dsu_rollback.cpp)
3. - [x] [Minimum queue](data_structure/min_queue.cpp)
4. - [x] [Segment tree](data_structure/segtree.cpp)
5. - [x] [Segment tree w/ lazy propagation](data_structure/segtree_lazy.cpp)
6. - [x] [Persistent segment tree](data_structure/persistent_segtree.cpp)
7. - [x] [Sparse table](data_structure/sparse_table.cpp)
8. - [x] [Ordered set](data_structure/ordered_set.cpp)
9. - [x] [Treap](data_structure/treap.cpp)
10. - [x] [Implicit Treap](data_structure/implicit_treap.cpp)
11. - [x] [Merge sort tree](data_structure/merge_sort_tree.cpp)

### Graph
1. - [x] [Dijkstra](graph/dijkstra.cpp)
1. - [x] [Bellman-Ford](graph/bellmanford.cpp)
1. - [x] [Floyd-Warshall](graph/floyd.cpp)
1. - [x] [Kruskal](graph/kruskal.cpp)
1. - [x] [Boruvka](graph/boruvka.cpp)
3. - [x] [Binary lifting](graph/lca_binary_lifting.cpp)
4. - [x] [Eulerian path](graph/eulerian_path.cpp)
5. - [x] [Topological sort](graph/topological_sort.cpp)
6. - [x] [Centroid decomposition](graph/centroid_decomp.cpp)
7. - [x] [Heavy-light decomposition](graph/hld.cpp)
8. - [x] [Edmonds Karp](graph/edmonds_karp.cpp)
9. - [x] [Dinic's algorithm](graph/dinic.cpp)
10. - [x] [Kosaraju](graph/kosaraju.cpp)
11. - [x] [2-SAT](graph/2-sat.cpp)
12. - [x] [De Bruijn sequence](graph/bruijn.cpp)
13. - [x] [Kuhn's algorithm](graph/kuhn.cpp)

### Dynamic Programming
1. - [x] [Longest common subsequence](dp/lcs.cpp)
1. - [x] [Longest palindromic subsequence](dp/lps.cpp)
1. - [x] [Longest increasing subsequence - naive O(N^2)](dp/lis.cpp)
1. - [x] [Longest increasing subsequence - fenwick tree O(NlogN)](dp/lis_nlog.cpp)
1. - [x] [Longest increasing subsequence - dp & bns O(NlogN)](dp/lis_nlog2.cpp)
1. - [x] [Travelling salesman problem O(N^2*2^N)](dp/tsp.cpp)

### Math
1. - [x] [Discrete logarithm](math/discrete_log.cpp)
1. - [x] [Discrete root](math/discrete_root.cpp)
1. - [x] [Extended GCD](math/ext_gcd.cpp)
1. - [x] [Linear sieve for divisors count](math/linear_div_cnt.cpp)
1. - [x] [Linear sieve for divisors sum](math/linear_div_sum.cpp)
1. - [x] [Linear sieve for Euler's totient function](math/linear_phi.cpp)
1. - [x] [Linear Eratosthenes sieve](math/linear_sieve.cpp)
1. - [x] [Least prime factor](math/lpf.cpp)
1. - [x] [Matrix exponentiation](math/matrix_expo.cpp)
1. - [x] [Euler's totient function](math/phi.cpp)
1. - [x] [Pollard's Rho 128 bit](math/pollard_rho_128bit.cpp)
1. - [x] [Pollard's Rho](math/pollard_rho.cpp)
1. - [x] [Primitive root](math/primitive_root.cpp)
1. - [x] [Rabin–Miller primality test](math/rabin_miller.cpp)
1. - [x] [Segmented sieve](math/segmented_sieve.cpp)
1. - [x] [Modular multiplication 64 bit in O(1)](math/modmul_64bit.cpp)
1. - [x] [Ternary search](math/ternary_search.cpp)
1. - [x] [Binomial coefficient w/ Lucas Theorem](math/nCk_lucas.cpp)
1. - [x] [Gaussian elimination](math/gaussian_elimination.cpp)
1. - [x] [Gaussian elimination XOR](math/gaussian_elimination_xor.cpp)

### String
1. - [x] [Longest palindromic substring O(N^2)](string/lp_substring.cpp)
1. - [x] [Hashing](string/hashing.cpp)
2. - [x] [Hashing w/ update](string/hashing_update.cpp)
3. - [x] [Hashing 2D](string/hashing2d.cpp)
4. - [x] [Rabin-Karp](string/rabin_karp.cpp)
5. - [x] [Prefix function](string/prefix_function.cpp)
6. - [x] [Prefix automaton](string/prefix_automaton.cpp)
7. - [x] [Suffix automaton](string/suffix_automaton.cpp)
8. - [x] [Z function](string/z.cpp)
9. - [x] [KMP](string/kmp.cpp)
10. - [x] [Trie](string/trie.cpp)
11. - [x] [Lyndon factorization (Duval algorithm)](string/duval.cpp)
12. - [x] [Suffix array](string/suffix_array.cpp)
13. - [x] [Longest Common Prefix (Kasai's algorithm)](string/lcp.cpp)

### Others
1. - [x] [Mo's algorithm](others/mo.cpp)
1. - [x] [First element greater than element i from left/right](others/alg1.cpp)
1. - [x] [Check ancestor in O(1)](others/ancestor.cpp)

competitive-programming

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README