Scribd
Upload
70 views3 pages

Data Structures and Algorithms Resources

I found this .txt file online. This guy shares some very useful compeitive programming links. More can be found on: https://drive.google.com/?authuser=0#folders/0B1Gjc2vKWRmLVTFGSThlQ1plcFk

Uploaded by

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

Data Structures and Algorithms Resources

I found this .txt file online. This guy shares some very useful compeitive programming links. More can be found on: https://drive.google.com/?authuser=0#folders/0B1Gjc2vKWRmLVTFGSThlQ1plcFk

Uploaded by

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

OPCENITO:

1. HSIN: [Link]
2. HONI: [Link]
3. USACO: [Link]
4. TopCoder: [Link]
5. TopCoder Forum: [Link]
6. TopCoder Algorithm Tutorials: [Link]
alg_index&module=Static
7. SPOJ: [Link]
8. CodeChef: [Link]
9. CodeForces: [Link]
10. Senior Computer Team: [Link]
11. Rosalind: [Link]
heights
12. LightOJ: [Link]
13. Kategorizirani problemi: [Link]
14. Awesome Awesomeness: [Link]
15. Quora: [Link]
16. MIT OpenCourseWare: [Link]
17. Interactive Python: [Link]
ds/[Link]
18. USACO Training: [Link]
STRUKTURE PODATAKA:
QUEUE:
1. [Link]
ructures
2. [Link]
3. [Link]
DataStrucs2#queue
4. vidi CLRS, Skiena-u i Kusalica

STACK:
1. [Link]
ructures
2. [Link]
3. [Link]
DataStrucs2#stack
4. vidi CLRS, Skiena-u i Kusalica

HEAP:
1. [Link]
2. vidi CLRS i Skiena-u
SEGMENT TREE(aka. TOURNAMENT):
1. [Link]
CommonAncestor#Segment_Trees
2. [Link]
3. [Link]
html
4. vidi Kusalica
BINARY INDEXED TREE(aka. FENWICK):
1. [Link]
IndexedTrees
2. [Link]
fenwick-tree/
3. [Link]
k-Tree
4. [Link]
-behind-a-binary-indexed-tree-and-how-was-it-thought-a
5. vidi Kusalica
GRAFOVI:

OPCENITO:
1. [Link]
2. [Link]
DataStrucs1
3. Matrica susjedstva: [Link]
4. Matrica susjedstva: [Link]
5. Lista susjedstva: [Link]
6. vidi CLRS, Skiena-u i Kusalica
BFS:
1. [Link]
DataStrucs2#breadth
2. [Link]
3. [Link]
.html
4. vidi CLRS, Skiena-u i Kusalica


DFS:
1. [Link]
DataStrucs2#depth
2. [Link]
3. [Link]
.html
4. vidi Kusalica

Dijkstra:
1. [Link]
DataStrucs3#dijkstra
2. [Link]
3. [Link]
4. vidi CLRS, Skiena-u i Kusalica
MATEMATIKA:

GCD i LCM:
1. [Link]
2. [Link]
3. vidi CLRS, Skiena-u i Kusalica
DINAMICKO PROGRAMIRANJE:
1. [Link]
2. [Link]
4. [Link]
5. vidi CLRS, Skeina-u i Kusalica
OSTALO:

BINARY SEARCH:
1. [Link]
Search
2. [Link]
BIT MANIPULATION:
1. [Link]
ipulation
2. [Link]
tml
RECURSION:
1. [Link]
ionPt1
2. [Link]
3. vidi CLRS, Skiena-u i Kusalica

You might also like