Dynamic Programming:
1. Dynamic Programming Optimization: http://codeforces.com/blog/entry/8219
2. 0/1 Knapsack and Coin Change (Iterative): https://sites.google.com/site/programinggconcept/programim-kantesta-programim
3. Advanced Dynamic Programming: http://apps.topcoder.com/forums/?module=Thread&threadID=697369&start=0&mc=22
4. Matrix Exponentiation: http://threads-iiith.quora.com/Solving-Dynamic-Programming-with-Matrix-Exponentiation
Data Structures:
1. Data Structures Overview: http://codeforces.com/blog/entry/15729
2. Segment Tree: https://codeforces.com/blog/entry/15890
3. Lazy Propagation: http://se7so.blogspot.com/2012/12/segment-trees-and-lazy-propagation.html
4. Persistent Segment Trees: Anudeep's Blog
5. Efficient and easy segment trees: http://codeforces.com/blog/entry/18051
6. When segment tree and when bit and range updating in bit: http://codeforces.com/blog/entry/6847
7. MO’s algorithm: http://blog.anudeep2011.com/mos-algorithm/#comments
8. String Hashing: https://threads-iiith.quora.com/String-Hashing-for-competitive-programming
9. Trie: https://threads-iiith.quora.com/Tutorial-on-Trie-and-example-problems
10. BIT: Range update in BIT: https://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/
Game Theory:
1. Grundy Numbers: Grundy Number for Contest
Number Theory:
1. Best Known algos for computing nCr%M: http://discuss.codechef.com/questions/3869/best-known-algos-for-calculating-ncr-m
2. Computing Modular Multiplicative Inverse: https://comeoncodeon.wordpress.com/2011/10/09/modular-multiplicative-inverse/
Graph Theory:
1.Printing Euler Path or Circuit: Euler
2.Kosaraju Algorithm: Kosaraju
3. 2 SAT - 2 sat
4.2 SAT- http://codeforces.com/blog/entry/16205
5.Good and fast code of max flow: http://acm.hust.edu.cn/vjudge/problem/viewSource.action?id=708921
6. Tree DP - http://www.gonglin91.com/tag/%E6%A0%91dp/
7. BFS:
http://www.shafaetsplanet.com/planetcoding/?p=604 (in Bangla language)
Problem:
8. Dijkstra:
http://www.shafaetsplanet.com/planetcoding/?p=1500 (in Bangla language)
Problem:
9. Bellman-Ford:
http://www.shafaetsplanet.com/planetcoding/?p=2044 (in Bangla language)
Problem:
10. Floyd-Warshall:
http://www.shafaetsplanet.com/planetcoding/?p=1927 (in Bangla language)
Problem Type:
11. Minimum Spanning Tree (MST):
http://www.shafaetsplanet.com/planetcoding/?p=825 (in Bangla language)
http://www.shafaetsplanet.com/planetcoding/?p=692 (in Bangla language)
Problem:
1. Maximum Spanning Tree
2. Minimum Spanning Subgraph
3. Minimum Spanning Forest
4. Second Best ST
5. Minimax and Maximin
` 6. https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3592
7. http://codeforces.com/problemset/problem/472/D
8. http://codeforces.com/contest/609/problem/E (Tarjan Criterion, LCA)
12. DFS:
Problem:
1. Finding Connected Components
2. Topsort
3. Graph edges property check(tree edge,back edge,forward edge/cross edge), Checking cycle in graph using back edge
Geometry: Code to follow : https://gsourcecode.wordpress.com/2013/02/22/1111-trash-removal/
Miscellaneous:
1. Many Good Blog Posts’ Links: Codeforces Blog Listing Many blogs
2. Code Library by an ICPC team: ALGOS
3. When Segment Tree and When BIT: At Quora
4. Programming Camp Syllabus suggested by Shanto SIR:Programming Camp Syllabus
5. An awesome quora blog post listing a number of tutorial list: http://qr.ae/7CLA9t
6. An awesome blog post on codechef listing algorithms and data structures: https://discuss.codechef.com/questions/48877/data-structures-and-algorithms
7. e-maxx in English: https://cp-algorithms.com/