Tutorial on disjoint set and union find with supporting heuristics.
http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=disjointDataStructure
2 Likes
Levenshtein distance algorithm
1 Like
> Catalan numbers
Why?
This is not an algorithm. The way they can describe a lot of stuff is nice, but Iâve never ever seen them used in a solution in competitive programming (unless you count âbruteforce the first few numbers and google them in OEISâ an algorithm, which I donât).
Similarly, anything that contains âad-hocâ is not an algorithm, practically by definition. âAd-hocâ means something that doesnât fall under a well-known algorithmic technique.
1 Like
Being a beginner and a little weak at Data Structures particularly from where should I start to get a good grip eventually?
There is an âawesomeâ resource for this and a lot other things. https://github.com/sindresorhus/awesome
Though I donât remember the original authorâs name, this is the best Iâve come across. Be sure to check it out.
sieve of eratosthenes and segmented sieve
You can also add data structures as DS + Algoâs = Programs. I suggest adding a few basic data structures which would help. Also you could add topics like DP.
Centroid Decomposition of Tree
Can anyone also mention the approaches that we have to know like Dynamic Programming or any other approaches for programming contests.
Classifying these algorithms based on the approach will also really be beneficial, may be i am asking for more here :).
âSorry You donât have enough reputation to upvoteâ How to get reputations :â( ??
Google âCodechefs new karma systemâ and go through the list.
Awesome compilation of all stuff in one place, appreciate everyoneâs hardwork 
You can refer to this link.
you can refer this link
nice work. really helpful ^-^
nice work. really helpful ^-^