Data structures & algorithms, for reference
- Binary Exponentiation
- Binary Search
- Convex Hull using Monotone chain
- Eucledian GCD
- Euler's Totient Function
- Extended Eucledian Algorithm
- Insertion Sort
- KMP for pattern matching
- Merge Sort
- Quick Sort
- Selection Sort
- Sieve Of Eratosthenes
- Finding smallest & second smallest in all subarrays
- Ternary Search
- Dynamic Programming
- Adjancey Matrix
- Adjancey List
- Breadth First Search
- Bellman - Ford
- Depth First Search
- Dijsktra (basic)
- Dijsktra (More generalized & using priority queue)
- Floyd - Warshall
- Eucledian circuit using Hierholzer's algo
- SCCs using Kosaraju's algo
- MST using Kruskal's method using DSU + Path compression + Rank union
- Topological sort