Collection of algorithms for competitive programming implemented mostly in Python. With exception to Closest pair which is in Rust and KMP wich is in C++. Everything in Python is implemented as stand alone methods or classes which can be copied in to a problem without extra imports.
- Fenwick Tree
- Segment Tree
- RMQ
- Closest Pair - Rust
- Convex Hull
- Polygon Area
- Point In Polygon
- 2-Sat
- BFS
- DAG
- Min-Max Flow
- Djikstras
- MST, Kruskal union-find
- Strongly Connected Components, kosaraju
- Miller–Rabin primality test
- Primesive
- GCD
- FFT
- KMP - C++
- Suffix Array