Scribd
Upload
216 views4 pages

Competitive Programming Resources

The document lists 57 links to resources on algorithms and data structures. The resources cover topics like treaps, segment trees, dynamic programming, string algorithms, binary search trees, and problems from sites like Codeforces, CodeChef, TopCoder, and SPOJ. Many of the links provide tutorials, explanations, and solutions to help understand and implement different algorithms and data structures important for competitive programming.

Uploaded by

Vikram Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
216 views4 pages

Competitive Programming Resources

The document lists 57 links to resources on algorithms and data structures. The resources cover topics like treaps, segment trees, dynamic programming, string algorithms, binary search trees, and problems from sites like Codeforces, CodeChef, TopCoder, and SPOJ. Many of the links provide tutorials, explanations, and solutions to help understand and implement different algorithms and data structures important for competitive programming.

Uploaded by

Vikram Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

 

Algorithms-Algorithms 
October 12, 2016 

Overview 
Please add the resources you think are important as you go 

1) Treaps :- 
[Link]
[Link]
2) Advanced DS :- ​[Link]
3) RMQ :- 
[Link]
mum-query-and-lowest-common-ancestor/#Segment_Trees 
4) Data Structures in competitive Programming :- 
[Link]
atastructures 
5) String Algo :- (Rabin-Karp & Knuth-Morris-Pratt Algo ) 
[Link]
n-to-string-searching-algorithms/ 
6) Dynamic Programming :- 
[Link]
ogramming-from-novice-to-advanced/ 
7) Almost all important Data Structure and Algorithm  
[Link]
8) [Link]
9) [Link]

 
2  
10) [Link]
11) [Link]
[Link]/interval-tree/ 
12) [Link]
13) [Link]
14) [Link]
atastructures 
15) [Link]
mum-query-and-lowest-common-ancestor/ 
16) [Link]
17) [Link]
18) [Link]
19) [Link]
20) [Link]
21) [Link] (MO’s Algorithm) 
22) [Link]
23) [Link]
24) [Link]
oF6n3b-thO 
25) Persistent Segment Trees :- 
[Link]
26) [Link]
e 
27) [Link]
e-to-answer-queries-of-kth-order-statistic-of-a-subarray-of-an-Integer-array 
28) [Link]
29) [Link]
mming-for-problems-that-involves-queries 

   

 
3  

30) [Link]
ng-BIT-Segment-Tree 
31) [Link]
ng-questions-with-queries/ 
32) [Link]
33) [Link]
34) [Link]
35) [Link]
ng-BIT-Segment-Tree 
36) [Link]
rsistent-segment-trees-an-online-solution 
37) [Link]
38) [Link]
39) [Link]
40) [Link]
41) [Link]
42) [Link] (Nice place to start with BIT) 
43) [Link] (Nice place to start with BIT) 
44) [Link] (Still don’t know how to solve) 
45) Proof that TREAP is not like a GOD TREE :- 
[Link]
46) Another BIT Problem h
​ ttp://[Link]/problemset/problem/341/B 
Solution (​[Link]
47) [Link]
48) [Link]
49) [Link]

   

 
4  

50) [Link]
ch/ 
51) [Link]
52) [Link]
53) [Link]
54)  

   

You might also like