algorithms

• search
• DP
• backtracking
• graphs
  • path finding
    • shortest paths
    • Eulerian paths
    • Hamiltonian paths
  • directed graphs
    • topological sort
    • cycle detection
  • connectivity
    • weak: spanning tree
    • strong: kosaraju’s algorithm
  • flows and cuts
    • ford-fulkerson algorithm
• sliding window
• two pointers
  • fast slow pointers
• merging
  • merge intervals
  • k-way merge
• top k elements
• sorting
• greedy
• bit manipulation

see also: algorithms to live by