Competitive Programming+Statistics resources

I'll add the topics which are unclear/unpractised, in order to keep track of them. I intend to attach resources for them.

Cool collection of resources:

1. Topicwise problems solved by the user -Morass-

2. More Resources! by the user Inishan

    

   Later, I realized that these resources contain a hell lotta information. The second one's comment section too is resourceful.  

List of topics that I need to work on:

1. Dynamic Programming : 1,2,3,4,5,6+, 7 ,8, 9*, 10  , 11*, 12   ,  13, 14*  , 15* ,16* , 17(MISC.)  , 18(Coin change)*
2. Depth First Search(DFS)+Breadth First Search(BFS) :1**,2* ,3*(Flood filling) ,4(Flood Fill, ACM 2011, finals)** ,5+(Kahn's Algo, Topological Sort),6(Graph Coloring),7(Graph Coloring),8**(Articulation Points),9*(Articulation Points),10**(Articulation Bridges),11*(Articulation Bridges),12**(Articulation Points), 13**(Traversal), 14(Traversal) 
3. Bellman-Ford :
4. Dijkstra's Algorithm :1(State-space)** ,2,3(Arrays>HashSet Dude!),4,5***
5. Kruskal's Algorithm :1*,2*,3*(Medium, Kruskal's+Prioritizing),4*(Precision),5
6. Prim's algorithm :
7. Unweighted single source shortest paths: 1**,2(3D Maze),3
8. All pairs shortest paths :1(Cool float formatting)
9. Mathematics : 1(Input was something new),2,3(base conversion),4(Segmented Sieve of Eratosthenes),5,6(Modulus operations)
10. Strings: 1(Cool. Not Submitted though.), 2(KMP)*, 3*,4** *

*- Wasn't submitted, but is assumed to be correct based on reasonable tests.
**- Pretty hard.
+- Couldn't Submit
Solutions:
DP:1,2,3,4,5,6, 7 , 8, 9, 10 , 11, 12  , 13, 14 , 15,16 ,17, 18 
DFS: 1, 2,3,4,5,6,7,8,9,10,11,12, 13, 14