We will learn all Data structures:

1. Array, List, Linked list and its variations like a Doubly linked list, circular list

2. Stack, queue

3. Tree, Binary tree, binary search tree. Height balanced binary search tree

4. Hashing

5. Heap data structure, min-heap, max heap, priority queue

6. Graph data structure and algorithms.

We will learn Algorithms:

Graph Algorithms

1. Breadth First Search (BFS)

2. Depth First Search (DFS)

3. Shortest Path from source to all vertices (Dijkstra)

4. Shortest Path from every vertex to every other vertex (Floyd Warshall)

5. Minimum Spanning tree (Prim)

6. Minimum Spanning tree (Kruskal)

7. Topological Sort

8. Johnson’s algorithm

9. Articulation Points (or Cut Vertices) in a Graph

10. Bridges in a graph

Dynamic Programming

1. Longest Common Subsequence

2. Longest Increasing Subsequence

3. Edit Distance

4. Minimum Partition

5. Ways to Cover a Distance

6. Longest Path In Matrix

7. Subset Sum Problem

8. Optimal Strategy for a Game

9. 0-1 Knapsack Problem

10. Assembly Line Scheduling

Searching And Sorting

1. Binary Search

2. Quick Sort

3. Merge Sort

4. Order Statistics

5. KMP algorithm

6. Rabin karp

7. Z’s algorithm

8. Aho Corasick String Matching

9. Counting Sort

10. Manacher’s algorithm

All Articles on Searching, Sorting and Pattern Searching.

Number theory and Other Mathematical

Prime Numbers and Prime Factorization

1. Sieve of Eratosthenes

2. Segmented Sieve

3. Wilson’s Theorem

4. Prime Factorization

5. Pollard’s rho algorithm

Modulo Arithmetic Algorithms

1. Basic and Extended Euclidean algorithms

2. Euler’s Totient Function

3. Modular Exponentiation

4. Modular Multiplicative Inverse

5. Chinese remainder theorem Introduction

6. Chinese remainder theorem and Modulo Inverse Implementation

Miscellaneous:

1. Counting Inversions

2. Counting Inversions using BIT

3. logarithmic exponentiation

4. Square root of an integer

5. Heavy light Decomposition , this and this

6. Matrix Rank

7. Gaussian Elimination to Solve Linear Equations

8. Hungarian algorithm

9. Link cut

10. Mo’s algorithm and this

11. Factorial of a large number in C++

12. Factorial of a large number in Java+

13. Russian Peasant Multiplication

14. Catalan Number

Geometrical and Network Flow Algorithms

1. Convex Hull

2. Graham Scan

3. Line Intersection

4. Interval Tree

5. Matrix Exponentiation and this

6. Maxflow Ford Furkerson Algo and Edmond Karp Implementation

7. Min cut

8. Stable Marriage Problem

9. Hopcroft–Karp Algorithm for Maximum Matching

10. Dinic’s algo and e-maxx