Algorithms-and-Data-Structures

Competetive Programming Library

Algorithm implementation in c++ for competitive programming purpose

Algorithms

Combinatorics

• Magic square minimum cost
• permutation

Dynamic Programming

• 01 knapsack
• Matrix Chain Multiplication

Data Structures

• Array compression
• BIT Range update Range query
• BIT, Fenwick tree
• BST
• DSU
• Segment tree lazy prop
• Sparse Table
• Without lazy segment tree
• segment tree max lazy prop

Graph

• BFS
• BFS , level of each node
• DFS tree
• Minimum edge from x to y
• kruskal
• prims

Greedy

• Fractional Knapsack

Number Theory

• Big Factorials
• Big Mod
• Bitwise sieve
• Consecutive odd and even sum
• Extended GCD
• NOD and SOD using prime factorization
• Phi sieve
• Phi(n)
• Segment Sieve
• Sieve in linear
• fact mod by value
• negative mod
• prime factorization
• prime sieve

Number Theory

• Binary search
• Ternary Search

Sorting

• Count sort
• Merge sort
• Struct Compare

String

• KMP algorithm
• string counting sort

Miscellaneous

• Big Integer C++ library
• GCC Compiler Optimization
• Maximum Histogram