This repo contains questions solved by me on Codechef and Codeforces
Binary Search
Quicksort
Merge Sort
Suffix Array
Knuth-Morris-Pratt Algorithm (KMP)
Rabin-Karp Algorithm
Tries
Depth First Traversal of a graph
Breadth First Traversal of a graph
Dijkstra's Algorithm
Binary Indexed Tree
Segment Tree (with lazy propagation)
Persistent Segment Tree
Z algorithm
Floyd Warshall Algorithm
Sparse Table(RMQ)
Heap / Priority Queue / Heapsort
Modular Multiplicative Inverse
nCr % M
Suffix Automaton
Lowest Common Ancestor
Counting Inversions
Euclid's Extended Algorithm
Suffix Tree
Dynamic Programming
Basic Data Structures
Logarithmic Exponentiation
Graphs
Minimum Spanning Tree
Efficient Prime Factorization
Combinatorics
Union Find/Disjoint Set
Knapsack problem
Aho-Corasick String Matching Algorithm
Strongly Connected Components
Bellman Ford algorithm
Heavy-light Decomposition
Convex Hull
Jarvis Algorithm Implementation
Line Intersection
Sieve of Erastothenes
Interval Tree
Counting Sort
Probabilities
Matrix Exponentiation
Network flow
Max Flow(Ford-Fulkerson)
K-d tree :
Deque
Binary Search Tree
Quick Select
Treap/Cartesian Tree
Game Theory
STL
Maximum Bipartite Matching
Manacher's Algorithm
Miller-Rabin Primality Test
Stable Marriage Problem
Hungarian Algorithm
Sweep line Algorithm
LCP
Gaussian Elimination
Pollard Rho Integer Factorization
Topological Sorting
Detecting Cycles in a Graph : Directed , Undirected
Geometry
Backtracking
Eulerian and Hamiltonian Paths
Graph Coloring
Meet in the Middle
Arbitrary Precision Integer(BigInt)
Radix Sort
Bucket Sort
Johnson's Algorithm
Maximal Matching in a General Graph
Recursion
Inclusion and Exclusion Principle
Coordinate Compression
Sqrt-Decomposition
Link-Cut Tree
Euler's Totient Function
Burnside Lemma
Edit/Levenshtein Distance
Branch and Bound
Math for Competitive Programming
Mo's Algorithm