Very useful stuff
More on Fenwick treeā¦might help
For Tower of Hanoi, I suggest you link it to Tower of Hanoi - Wikipedia. The link you specified only gives the code for it and does attempt to explain the problem. The Wikipedia link explains it properly.
I will try to help you by solving some of the questions myself.
This is awesome work. Thank you everyone! and i thought i would suggest this: CS 97SI: Introduction to Programming Contests 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 !
http://www.comp.nus.edu.sg/~stevenha/visualization/index.html
This contains nice illustrations.
Thanks brother, this is a treasure
Thank you so much.
To understand how algorithms word, link below is very useful,
VisuAlgo - visualising data structures and algorithms through animation
calculating nCr
also RMQ is more clearly described here
For edit Distance:-
Dynamic Programming Algorithm, Edit Distance and for introduction:
WagnerāFischer algorithm - Wikipedia
please post some links of tutorials on voronoi diagrams,online construction of 3D convex hull,deunay triangulation and other computational geometry algorithms which are commonly used.Thanks in advance.
Can someone add more links to DP optimization techniques?
Nice tutorialā¦ Quite a lot helpful
Here are a few more questions which you are add to the binary Indexed tree section:
Many thanks for taking the initiative and creating this wonderful list.
A topic that appears alot these days in many programming contests is Matrix exponentiation. Can someone suggest a good tutorial on that with the variety of problems. Any help will be highly appreciated.
Thanks for this good information. Mathematics for programming will be helpful.
I started some of these on 24th September, will complete on 24h November, thank you for great compilation, and all comments
This is for dynamic programming, especially for the beginners:
Please excuse me if it has been already added before. There are too many posts to check all of them!
Nyc work brotherā¦ but donāt know where to get startedā¦ totally confused