DATA STRUCTURE:

1. Stack
2. Queue
3. Priority Queue
4. Linked list
5. Heap
6. Hash table
7. Disjoint Set, Union Find
8. Binary Search Tree
9. Trie, Suffix Array
10. Segmented Tree,Range minimum Query
11. Binary Indexed Tree(BIT)
12. Heavy light Decomposition

SORTING:

1. Bubble Sort
2. Selection Sort
3. Insertion Sort
4. Quick Sort
5. Merge Sort
6. Counting Sort
7. Radix Sort
8. Bucket Sort
9. Heap Sort
10. Searching:
11. Linear Search
12. Binary Search
13. Ternary Search
14. Map, HashMap

DYNAMIC PROGRAMMING

1. Rod Cutting
2. Maximum Sum (1D, 2D)
3. Coin Change
4. Longest Common Subsequence
5. Longest Increasing subsequence, Longest Decreasing Subsequence
6. Matrix Chain multiplication
7. Edit Distance
8. Knapsack problem, 0-1 Knapsack
9. Bitmask DP
10. Traveling Salesman problem

GREEDY ALGORITHM:

1. Activity selection/Task scheduling problem
2. Huffman coding

GRAPH THEORY:

1. Graph Representation(matrix, list/vector)
2. Breadth First Search(BFS)
3. Depth First Search(DFS)
4. Topological Sort
5. Strongly Connected Component(SCC)
6. Minimum Spanning Tree(kruskal, prim)
7. All pair's shortest path(Floyd Warshall)
8. Djkastra algorithm
9. Bellman Ford Algorithm
10. Directed Acyclic Graph
11. Bipartite Matching
12. Max-Flow, Min-cost max-flow
13. Cayley's Theorem
14. Articulation Point, Bridge
15. Euler tour/path
16. Hamiltonian Cycle
17. Stable Marriage problem
18. Chinese Postman problem
19. Number Theory:
20. Josephus Problem
21. Farey Sequence
22. Euler's phi
23. Catalan numbers
24. Burnside's lemma/circular permutation
25. Modular inverse
26. Probability
27. Chinese Remainder Theorem
28. Gaussian Elmination method
29. Dilworth's Theorem
30. Matrix Exponentiation
31. Determinant of a matrix
32. RSA public key crypto System
33. Computational Geometry:
34. Pick's Theorem
35. Convex hull
36. Line Intersection
37. Point in a polygon
38. Area of a polygon
39. Line Sweeping
40. Polygon intersection
41. Closest Pair

GAME THEORY:

1. Take Away game
2. Nim
3. Sprague-grundy Number

STRING

1. Naive String matching 
2. Rabin karp Algo
3. Finite Automata
4. Knuth-Marris-Pratt Algo
5. Manacher's Algo
6. Aho korasick's Algo
7. Boyer-Moore algo