*1. Data Structures Algorithm :*

* Segment Tree

* Binary Indexed Tree (BIT)

* Trie

*2. Dynamic Programming*

* Longest Increasing Sub sequence (LIS NlogK)

*3. Graph Theory*

* BFS Sample Code

* DFS Sample Code

* Minimum Spanning Tree (Kruskal)

* Strongly Connected Component (Kosaraju)

* Articulation Point

*4. String matching*

* Knuth Morris Prat (KMP)

*5. Mathematics and Number theory*

* nCr%m when m is not prime

Advertisements