Skip to content

Latest commit

 

History

History
37 lines (33 loc) · 4.32 KB

File metadata and controls

37 lines (33 loc) · 4.32 KB

Topics


  • Data structure:

    • Binary indexed tree : < /> < />
    • Persistent segment tree : < />
    • Sliding window minimum : < /> 🔗
    • Suffix array construction : < />
    • Trie implementation with 2D array : < />
  • Graph:

    • Hopcroft-Karp algorithm - maximum bipartite matching : < />
    • Strongly Connected Component (SCC) - Tarjan algorithm : < />
    • Topological sort : < />
    • Topological sort - using dfs : < />
  • Math:

    • Chinese remainder theorem (CRT) : < />
    • Euler totient or phi function : 🔗
    • Fermat's last theorem : 🔗
    • Fermat's little theorem : 🔗
    • Josephus problem < />
    • Matrix expo : < /> 🔗
    • Miller–Rabin primality test : < /> 🔗 🔗
    • Modular exponentiation : < />
    • Modular Multiplicative Inverse : < />
    • Segmented Sieve : < />
    • Sieve of Eratosthenes : < /> 🔗
  • Sort:

  • String:

    • Knuth-Morris-Pratt (KMP) - Pattern search : < />
    • Rabin-Karp Algorithm (modified) - Pattern matching : < />
  • Others: