Fundamentals

• Complexity analysis
• Master theorem
• Recursion
• Binary search
• Binary search on answer
• Modular arithmetic
• $\min \max$ → binary search
• Harmonic series $\sum_{n=1}^{N} \frac{1}{n} = O(\log N)$

Graphs

Basic

• DFS
• BFS
• Coloring in 2 colors
• Dijkstra
  • Dijkstra in $O(V^2)$
  • Dijkstra in $O(E \log V)$ with heap
• Ford-Bellman
• Floyd
• MST Prim
• MST Kruskal

Directed graphs