It is a small repository where you find the implementations of some Algorithms and Data Structures that I learned in my competitive programming journey. All of the code is written in c or c++.

Data Structure

• Sparse Table
• Disjoint Set Union
• Square Root Decomposition
• Binary Index Tree
• Segment Tree
  • Segment Tree without Lazy
  • Segment Tree with Lazy
• Persistent Segment Tree
  • Persistent Segment Tree (Linked List)
  • Persistent Segment Tree (Static Array)
• Lowest Common Ancestor
• Trie Tree
• Binary Search Tree
• Linked List

Graph

• Breadth First Search
• Depth First Search
• Topological Sort
  • Topological Sort basic with indegree
  • Topological Sorting with finishig time in dfs
• Articulation Point
• Bridge
• Strongly Connected Components
• Dijkstra
• Minimum Spanning Tree
  • Minimum Spanning Tree basic
  • MST Second Minimum

String

• String Hashing
• Knuth–Morris–Pratt Algorithm
• Z Function Algorithm
• Rabin Karp Algorithm
• Manacher's Algorithm
• Suffix Array
• Summation of two number use string

Dynamic Programming

• Coin Change
• 0/1 Knapsack
• Longest Common Subsequence
• Longest Increasing Subsequence(n^2)
• Longest Increasing Subsequence(nlogn)
• Bit Mask DP
• Minimum Vertex Cover
• Digit DP

Mathematics

• Fast Exponentiation

Number Theory

• Sieve
  • Sieve of Eratosthenes
  • Bitwise Sieve
• Number of Divisors
  • Count number_of_divisors
  • Find all divisors
• Sum of Divisors
• Prime Factorization

Sorting

• Bubble Sort
• Counting Sort
• Selection Sort
• Insertion Sort
• Merge Sort
• Quick Sort
• Heap Sort
• Radix Sort

Miscellaneous

• Magic Square
  • Doubly Even Magic Square
  • Odd Numbered Magic Square

Note

If you want to use some of those code please see the verdict in code description. If the verdict is "Done/Complete/Ok etc" then the code is good to use but if the verdict is "Trying" then the code is not completed yet.

License

MIT

Free Software, Hell Yeah!