Algorithm

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

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s