Note: this is a publish-only repository, so all pull requests will be ignored.

The folders structure is following:

• notebook: well-explained implementation of general-purpose algorithms.
• scripts: small scripts for automatizing some repetitive tasks.
• solutions: code of accepted problems, categorized by online judges.
• solutions/README.md: solutions index by themes, containing difficulty, name, description and hint of the problem.

Notebook index

🧱 data structures

• segment tree
• lazy segment tree
• sparse table
• union-find disjoint sets (UFDS)

🔞 dynamic programming

• coin change
• subset sum
• 0-1 knapsack
• edit distance
• longest common subsequence (LCS)
• longest palindromic subsequence (LPS)
• longest increasing subsequence (LIS)
• LCS reduced to LIS
• traveling salesman problem (TSP)
• matrix chain multiplication (MCM)
• rod cutting

🌍 graphs

• traversal
  • depth-first search (DFS)
  • breadth-first search (BFS)
  • flood fill
  • edge classification
  • bridges and articulations points
  • strongly connected components (SCC)
  • topological sorting
    • kahn
    • naive
• minimum spanning tree (MST)
  • kruskal
  • variants
    • minimax path
• network flow
  • max flow
    • edmonds karp
  • min cost max flow
• shortest path
  • single-source
    • bellman ford
    • dijkstra
• specials
  • bipartite graph
    • bipartite checking
    • maximum cardinality bipartite matching
  • directed acyclic graph
  • tree
    • lowest common ancestor (LCA)
    • heavy-light decomposition (HLD)

✏️ math

• matrix power
• number theory
  • fast power
  • prime numbers
    • prime checking
    • sieve of eratosthenes
    • modified sieve
    • optimized prime checking
    • prime factors of n
    • prime factors of n!
    • number of divisors of n
    • sum of divisors of n

💭 miscellaneous

• binary search
• bitmasks
• two pointers

References

• HALIM, Steven. "Competitive Programming 3: The new lower bound of programming contests".