This repo contains various frequently-used codes in competitive programming. These are properly commented so they will be easy to use and understand.
- Template
- Dijikstra
- Belman Ford
- Floyd Warshall
- Kruskal
- Prims
- Topo Sort
- Template
- Flattening of tree
- Lowest Common Ancestor
- DSU on tree
- Merge Sort Tree
- Simple Segment Tree
- Segment Tree with Lazy updates
- Extended Eucleid
- Fast Exponentiation
- Matrix Expo
- Sieve
- KMP
- Binary Indexed Tree
- Binary Search
- DSU
- LIS using set
- Mo's Algo
- Sparse Table
- Trie