Algorithms

Data Structures and Algorithms for Problem Solving

Data Structures

• Array(Vector)
• Stack
• Queue
• Heap(Binary Heap)
• Disjoint sets (Union-find)
• Segment Tree
• Fenwick Tree

Sorting & Searching

• Sorting
  • Insertion Sort
  • Quick Sort
  • Merge Sort
  • Counting Sort(Bucket Sort)
• Searching
  • Binary Search
  • Divide and Conquer
  • Two pointer
  • Greedy
  • Dynamic Programming

Graph & Tree

• Topological Sort
• Finding cut edges, vertices
• Longest Common Ancestor
• Shortest path
  • Dijkstra
  • Floyd-Warshall
  • Bellman-Ford
• Minimum Spanning Tree
  • Kruskal
  • Prim
• Network Flow
  • Floyd Warshall's
  • Edmonds Karp's
  • Dinic's
• Maximum Matching (Bipartite Graph)
• SCC
  • Tarjan
  • Koasaraju

String

• Trie
• Hashing
• KMP
• Aho-corasick
• Suffix Array
• Longest Common Prefix

Other Techinques

• Bitmasking
• Mathematics
  • Prime Numbers, Sieve
  • Binomial Coefficients
  • Greatest Common Divisor
  • Extended Euclid
  • Phi Function
• Computational Geometry
  • Vector2
  • CCW
  • Convex Hull
  • Point
• Lazy propagation
• Sqrt Decomposition
• Heavy light decomposition