Bismillahir Rahmanir Rahim
Mathematics:
- Sieve of Eratosthenes (prime finding)
- Bitwise Sieve
- Segmented Sieve
- prime factorization
- https://www.dropbox.com/s/ndai0fquchmazu7/factorization.pdf (pdf by jan vai)
- GCD, LCM
- Factorial
- Fibonacci
- Counting, Permutation, combination
- Exponentiation
- Modular Arithmetic
- Euclid, Extended euclid
Data Structure:
- Stack
- Queue
- Priority Queue
- Linked list
- Heap
- Hash table
- Disjoint Set, Union Find
- Binary Search Tree
- Trie, Suffix Array
- Binary Indexed Tree(BIT)
- Segmented Tree
- Heavy Light decompositon
Sorting:
- Bubble Sort
- Selection Sort
- Insertion Sort
- Shell Sort
- Quick Sort
- Merge Sort
- Counting Sort
- Radix Sort
- Bucket Sort
- Heap Sort
Searching:
- Linear Search
- Binary Search
- Ternary Search
- Map, HashMap
Dynamic Programming:
- Rod Cutting
- Maximum Sum (1D, 2D)
- Coin Change
- Longest Common Subsequence
- Longest Increasing subsequence, Longest Decreasing Subsequence
- Calculating nCr using DP
- Matrix Chain multiplication
- Edit Distance
- 0-1 Knapsack
- Bitmask DP
- Traveling Salesman problem
- Digit DP
Greedy algorithm:
- Activity selection/Task scheduling problem
- Huffman coding
- Fractional knapsack problem
Graph Theory:
- Graph Representation(matrix, list/vector)
- Breadth First Search(BFS)
- Depth First Search(DFS)
- Bipartite Graph checking
- Topological Sort
- Strongly Connected Component(SCC)
- Minimum Spanning Tree(MST)
- Kruskal’s Algorithm
- Prim’s Algorithm
- Directed MST
- All pair's shortest path(Floyd Warshall)
- Djkastra algorithm
- Bellman Ford Algorithm
- Directed Acyclic Graph
- Bipartite Matching
- Max-Flow, Min-cost max-flow
- Cayley's Theorem
- Articulation Point
- Bridge
- Euler tour/path
- Hamiltonian Cycle
- Stable Marriage problem
- Chinese Postman problem
- Minimum Vertex Cover(Graph+DP)
Number Theory:
- Josephus Problem
- Farey Sequence,Stern-brocot Tree
- Catalan numbers
- Euler's phi
- Burnside's lemma/circular permutation
- Modular inverse
- Probability
- Chinese Remainder Theorem
- Gaussian Elmination method
- Dilworth's Theorem
- Matrix Exponentiation
- Determinant of a matrix
- RSA public key crypto System
Computation Geometry:
- Pick's Theorem
- Convex hull
- Line Intersection
- Segment circle intersection
- Point in a polygon
- Area of a polygon
- Line Sweeping
- Polygon intersection
- Closest Pair
Game Theory:
- Take Away game
- Nim
- Sprague-grundy Number
String:
- Naive String matching
- Rabin karp Algo
- Finite Automata
- Knuth-Marris-Pratt Algo
- Manacher's Algo
- Aho korasick's Algo
- Boyer-Moore Algorithm
Others:
- Recursion
- Backtracking
- Hungarian Algorithm
- C++ STL(Standard Template Library)
- Bitwise operations
