Page Index - YessineJallouli/Competitive-Programming GitHub Wiki
57 page(s) in this GitHub Wiki:
- Home
- Welcome to the Competitive-Programming wiki!
- Tools for contest :
- Number Theory :
- Mathematics :
- Graph Theory :
- Data Structures
- Algorithms :
- Strings :
- Techniques :
- 0 1 Trie
- 2D Segment Tree
- Best Edu contests
- Best Problems
- Binomial coefficient O(N) && O(N^2)
- Bipartite matching : Hungarian algorithm
- Bipartite matching : Kuhn's algorithm
- Centroid Decomposition
- Chinese Remainder Theorem
- Code Jam Hackercup
- Dynamic Segment Tree
- Euler totient function (phi)
- Fenwick Tree (BIT)
- Heavy light decomposition
- Krushkal's MST (Minimum Spanning Tree)
- LCA (Lowest Common Ancestor)
- Matrices
- Mo's & Update
- Mo's algorithm
- Mo's on tree (Query on Path)
- Mo's on tree (Query on subtree)
- Möbius Function
- Ordered Segment Tree
- Ordered Statistic Tree (__gnu_pbds)
- Persistent Dynamic Segment Tree
- Pollard's rho Factorization
- Prefix function. KMP algorithm
- Prim's MST (Minimum Spanning Tree)
- Rerooting
- Segment Tree
- Segment Tree Lazy propagation
- Shortest path : Bellman Ford
- Shortest path : Dijkstra
- Shortest path : Floyd Warshall
- Sieve of Eratosthenes
- Sliding Window Maximum
- Sparse Table (RMQ)
- Squelette
- Stress Test
- Strongly Connected Components (SCC)
- Suffix array
- Testing Tool For GCJ
- Topological Sort
- Trie
- Union Find
- Xor Basis
- Z function