Thanks a lot
Superb initiative !! Keep it up
I hope i will help you
I hope so too
persistent segment tree: Explanation with basic code, tutorial with implementations of spoj and codechef problems by Anudeep Nekkanti
will add
Try this for classical problems of dp(interactive tutorial)
More concise collection of STLā¦
Thanks!
Thanks!
For BIT use this tutorial: http://stackoverflow.com/questions/15439233/bitusing-a-binary-indexed-tree - way better than all other resources.
And thanks for the resource.
Thanks friends .These links are really useful for newbies like us. May Allah(swt) bless and guide all those who contributed in collecting these links.
Very useful stuff
More on Fenwick treeā¦might help
already added
For Tower of Hanoi, I suggest you link it to http://en.wikipedia.org/wiki/Tower_of_Hanoi#Recursive_solution. The link you specified only gives the code for it and does attempt to explain the problem. The Wikipedia link explains it properly.
Thanks added
I will try to help you by solving some of the questions myself.
Dijkstra Algorithm https://www.youtube.com/watch?v=zXfDYaahsNA
Maybe you can add this also this video tutorial. Awesome video.
sorry not adding videos in to this list right now otherwise i would have added MIT videos as well
This is awesome work. Thank you everyone! and i thought i would suggest this: http://web.stanford.edu/class/cs97si/ for some of the main topics. It was Stanfordās course meant specifically for programming competitions. It helped me a lot. Sorry, if is present in the list already !