Competition-Stuff

Resources

• Google doc with useful topics

Graph Algorithms

1. DFS (Topological Sort, Strongly Connected Components)
2. BFS
3. Eulerian path
4. Hamiltonian path
5. Dijkstra's
6. Prim's (Minimum Spanning Tree)
7. Kruskal's (Minimum Spanning Tree)
8. Floyd Warhsall (Multiple Source Shortest Path)
9. Bellman Ford (Single Source shortest path with negative edges)
10. Johnson’s algorithm for sparse graphs (MUltiple Source Shortest Path)
11. Ford-Fulkerson method for maximum flow
12. Edmonds-Karp algorithm for maximum flow
13. Bipartite matching
14. [Longest path problem](Longest path problem)

Karp's 21 NP-complete problems

Geometry

1. Graham Scan
2. Shortest Path with polygon obstacles
3. Intersections
4. Fixed-Radius Near Neighbor Problem
5. Bently Ottmann

Strings

1. Knuth Morris Pratt
2. Suffix arrays

Common Dynamic Programming

1. Longest Common Substring

Number Theory

1. Sieve of that greek guy
2. brute force prime test
3. N choose R
4. Chinese Remainder Theorem
5. GCD