|
|
001 Algorithms Visualization App.mp4
|
MP4
|
13.7 MB
|
|
|
001 Algorithms Visualization App_en.vtt
|
VTT
|
0 B
|
|
|
001 Brute-force search introduction.mp4
|
MP4
|
21.4 MB
|
|
|
001 Brute-force search introduction_en.vtt
|
VTT
|
8.6 KB
|
|
|
001 Course materials.html
|
HTML
|
102.4 B
|
|
|
001 Cycle detection introduction.mp4
|
MP4
|
36 MB
|
|
|
001 Cycle detection introduction_en.vtt
|
VTT
|
11.1 KB
|
|
|
001 Eulerian cycles introduction.mp4
|
MP4
|
37.4 MB
|
|
|
001 Eulerian cycles introduction_en.vtt
|
VTT
|
10.9 KB
|
|
|
001 Introduction.mp4
|
MP4
|
11.2 MB
|
|
|
001 Introduction_en.vtt
|
VTT
|
2.4 KB
|
|
|
001 Networking and the longest common prefix problem.mp4
|
MP4
|
28.6 MB
|
|
|
001 Networking and the longest common prefix problem_en.vtt
|
VTT
|
8.8 KB
|
|
|
001 Tarjan algorithm introduction.mp4
|
MP4
|
35.7 MB
|
|
|
001 Tarjan algorithm introduction_en.vtt
|
VTT
|
11.8 KB
|
|
|
001 What are Fenwick trees.mp4
|
MP4
|
45.6 MB
|
|
|
001 What are Fenwick trees_en.vtt
|
VTT
|
13.2 KB
|
|
|
001 What are Hamiltonian cycles.mp4
|
MP4
|
40.6 MB
|
|
|
001 What are Hamiltonian cycles_en.vtt
|
VTT
|
14 KB
|
|
|
001 What are splay trees.mp4
|
MP4
|
55.3 MB
|
|
|
001 What are splay trees_en.vtt
|
VTT
|
15.9 KB
|
|
|
001 What are ternary search trees.mp4
|
MP4
|
27 MB
|
|
|
001 What are ternary search trees_en.vtt
|
VTT
|
7.6 KB
|
|
|
001 What are tries (prefix trees).mp4
|
MP4
|
41 MB
|
|
|
001 What are tries (prefix trees)_en.vtt
|
VTT
|
11.4 KB
|
|
|
001 What is boggle and how to solve it.mp4
|
MP4
|
23.7 MB
|
|
|
001 What is boggle and how to solve it_en.vtt
|
VTT
|
8.6 KB
|
|
|
001 What is external memory.mp4
|
MP4
|
38.6 MB
|
|
|
001 What is external memory_en.vtt
|
VTT
|
9.7 KB
|
|
|
001 What is topological ordering.mp4
|
MP4
|
57.4 MB
|
|
|
001 What is topological ordering_en.vtt
|
VTT
|
15.7 KB
|
|
|
001 Why to use cache.mp4
|
MP4
|
17.8 MB
|
|
|
001 Why to use cache_en.vtt
|
VTT
|
3.9 KB
|
|
|
002 Algorhyme - Algorithms and Data Structures.html
|
HTML
|
1.9 KB
|
|
|
002 Boggle game with ternary search tree implementation I.mp4
|
MP4
|
38.9 MB
|
|
|
002 Boggle game with ternary search tree implementation I_en.vtt
|
VTT
|
8.3 KB
|
|
|
002 Brute-force substring search algorithm implementation.mp4
|
MP4
|
24.5 MB
|
|
|
002 Brute-force substring search algorithm implementation_en.vtt
|
VTT
|
7.5 KB
|
|
|
002 Cycle detection implementation.mp4
|
MP4
|
38.7 MB
|
|
|
002 Cycle detection implementation_en.vtt
|
VTT
|
11.2 KB
|
|
|
002 Disk access times.mp4
|
MP4
|
21.1 MB
|
|
|
002 Disk access times_en.vtt
|
VTT
|
5 KB
|
|
|
002 Eulerian cycles applications.mp4
|
MP4
|
7.3 MB
|
|
|
002 Eulerian cycles applications_en.vtt
|
VTT
|
1.8 KB
|
|
|
002 Fenwick trees theory - tree structure.mp4
|
MP4
|
17.7 MB
|
|
|
002 Fenwick trees theory - tree structure_en.vtt
|
VTT
|
4.9 KB
|
|
|
002 LRU cache illustration.mp4
|
MP4
|
28.2 MB
|
|
|
002 LRU cache illustration_en.vtt
|
VTT
|
8.9 KB
|
|
|
002 Longest common prefix implementation.mp4
|
MP4
|
44.6 MB
|
|
|
002 Longest common prefix implementation_en.vtt
|
VTT
|
8.8 KB
|
|
|
002 Prefix tree introduction - insertion and searching.mp4
|
MP4
|
25.5 MB
|
|
|
002 Prefix tree introduction - insertion and searching_en.vtt
|
VTT
|
11.4 KB
|
|
|
002 Splay tree introduction - example.mp4
|
MP4
|
10.6 MB
|
|
|
002 Splay tree introduction - example_en.vtt
|
VTT
|
4.6 KB
|
|
|
002 Tarjan algorithm visualization.mp4
|
MP4
|
23.7 MB
|
|
|
002 Tarjan algorithm visualization_en.vtt
|
VTT
|
11.7 KB
|
|
|
002 Ternary search tree visualization.mp4
|
MP4
|
25.3 MB
|
|
|
002 Ternary search tree visualization_en.vtt
|
VTT
|
12.7 KB
|
|
|
002 The travelling salesman problem.mp4
|
MP4
|
9.7 MB
|
|
|
002 The travelling salesman problem_en.vtt
|
VTT
|
3.3 KB
|
|
|
002 Topological ordering implementation.mp4
|
MP4
|
39.6 MB
|
|
|
002 Topological ordering implementation_en.vtt
|
VTT
|
10.3 KB
|
|
|
003 Boggle game with ternary search tree implementation II.mp4
|
MP4
|
65.5 MB
|
|
|
003 Boggle game with ternary search tree implementation II_en.vtt
|
VTT
|
13.5 KB
|
|
|
003 Fenwick trees theory - update.mp4
|
MP4
|
30.6 MB
|
|
|
003 Fenwick trees theory - update_en.vtt
|
VTT
|
9 KB
|
|
|
003 Finding the shortest path with topological ordering.mp4
|
MP4
|
24.6 MB
|
|
|
003 Finding the shortest path with topological ordering_en.vtt
|
VTT
|
7.9 KB
|
|
|
003 LRU cache implementation I.mp4
|
MP4
|
34.3 MB
|
|
|
003 LRU cache implementation I_en.vtt
|
VTT
|
10.5 KB
|
|
|
003 Prefix tree introduction - sorting.mp4
|
MP4
|
12.4 MB
|
|
|
003 Prefix tree introduction - sorting_en.vtt
|
VTT
|
5 KB
|
|
|
003 Rabin-Karp algorithm introduction.mp4
|
MP4
|
65.6 MB
|
|
|
003 Rabin-Karp algorithm introduction_en.vtt
|
VTT
|
24.6 KB
|
|
|
003 Splay trees implementation I.mp4
|
MP4
|
27.6 MB
|
|
|
003 Splay trees implementation I_en.vtt
|
VTT
|
7.8 KB
|
|
|
003 Tarjan algorithm implementation.mp4
|
MP4
|
56.5 MB
|
|
|
003 Tarjan algorithm implementation_en.vtt
|
VTT
|
14.4 KB
|
|
|
003 Ternary search tree implementation I.mp4
|
MP4
|
35.4 MB
|
|
|
003 Ternary search tree implementation I_en.vtt
|
VTT
|
7.7 KB
|
|
|
003 Travelling salesman problem implementation.mp4
|
MP4
|
102.5 MB
|
|
|
003 Travelling salesman problem implementation_en.vtt
|
VTT
|
21 KB
|
|
|
003 What are B-trees.mp4
|
MP4
|
29.4 MB
|
|
|
003 What are B-trees_en.vtt
|
VTT
|
9.5 KB
|
|
|
004 Applications of strongly connected components.mp4
|
MP4
|
46.3 MB
|
|
|
004 Applications of strongly connected components_en.vtt
|
VTT
|
9.4 KB
|
|
|
004 B-tree introduction - insertion.mp4
|
MP4
|
21.5 MB
|
|
|
004 B-tree introduction - insertion_en.vtt
|
VTT
|
13.6 KB
|
|
|
004 Boggle game with ternary search tree implementation III.mp4
|
MP4
|
22.7 MB
|
|
|
004 Boggle game with ternary search tree implementation III_en.vtt
|
VTT
|
3.8 KB
|
|
|
004 Fenwick trees implementation I.mp4
|
MP4
|
26.5 MB
|
|
|
004 Fenwick trees implementation I_en.vtt
|
VTT
|
8.4 KB
|
|
|
004 LRU cache implementation II.mp4
|
MP4
|
44.6 MB
|
|
|
004 LRU cache implementation II_en.vtt
|
VTT
|
11 KB
|
|
|
004 Prefix tree introduction - autocomplete.mp4
|
MP4
|
12.5 MB
|
|
|
004 Prefix tree introduction - autocomplete_en.vtt
|
VTT
|
4.5 KB
|
|
|
004 Rabin-Karp algorithm implementation.mp4
|
MP4
|
67.1 MB
|
|
|
004 Rabin-Karp algorithm implementation_en.vtt
|
VTT
|
17.3 KB
|
|
|
004 Recursion and stack memory visualization.mp4
|
MP4
|
35.7 MB
|
|
|
004 Recursion and stack memory visualization_en.vtt
|
VTT
|
9.7 KB
|
|
|
004 Splay trees implementation II.mp4
|
MP4
|
34.2 MB
|
|
|
004 Splay trees implementation II_en.vtt
|
VTT
|
8 KB
|
|
|
004 TSP and stack memory visualization.mp4
|
MP4
|
47.7 MB
|
|
|
004 TSP and stack memory visualization_en.vtt
|
VTT
|
16.3 KB
|
|
|
004 Topological ordering shortest path implementation I.mp4
|
MP4
|
33.2 MB
|
|
|
004 Topological ordering shortest path implementation I_en.vtt
|
VTT
|
10.2 KB
|
|
|
005 B-tree introduction - deletion.mp4
|
MP4
|
15.3 MB
|
|
|
005 B-tree introduction - deletion_en.vtt
|
VTT
|
7.9 KB
|
|
|
005 Fenwick trees implementation II.mp4
|
MP4
|
42.4 MB
|
|
|
005 Fenwick trees implementation II_en.vtt
|
VTT
|
9.6 KB
|
|
|
005 Knuth-Morris-Pratt algorithm introduction.mp4
|
MP4
|
41.2 MB
|
|
|
005 Knuth-Morris-Pratt algorithm introduction_en.vtt
|
VTT
|
16 KB
|
|
|
005 LRU cache implementation III.mp4
|
MP4
|
25.3 MB
|
|
|
005 LRU cache implementation III_en.vtt
|
VTT
|
5 KB
|
|
|
005 Prefix tree introduction - associative arrays.mp4
|
MP4
|
11.5 MB
|
|
|
005 Prefix tree introduction - associative arrays_en.vtt
|
VTT
|
5.8 KB
|
|
|
005 Splay trees implementation III.mp4
|
MP4
|
54.4 MB
|
|
|
005 Splay trees implementation III_en.vtt
|
VTT
|
9.9 KB
|
|
|
005 Ternary search tree implementation II.mp4
|
MP4
|
28.8 MB
|
|
|
005 Ternary search tree implementation II_en.vtt
|
VTT
|
6.2 KB
|
|
|
005 Topological ordering shortest path implementation II.mp4
|
MP4
|
38.5 MB
|
|
|
005 Topological ordering shortest path implementation II_en.vtt
|
VTT
|
9.1 KB
|
|
|
005 Why to use meta-heuristics.mp4
|
MP4
|
20.2 MB
|
|
|
005 Why to use meta-heuristics_en.vtt
|
VTT
|
6.9 KB
|
|
|
006 B-tree variants and file systems.mp4
|
MP4
|
23 MB
|
|
|
006 B-tree variants and file systems_en.vtt
|
VTT
|
5.8 KB
|
|
|
006 Constructing the partial match table - visualization.mp4
|
MP4
|
31.1 MB
|
|
|
006 Constructing the partial match table - visualization_en.vtt
|
VTT
|
10.3 KB
|
|
|
006 Dynamic programming with topological sort.mp4
|
MP4
|
38.3 MB
|
|
|
006 Dynamic programming with topological sort_en.vtt
|
VTT
|
10.1 KB
|
|
|
006 Splay trees application.mp4
|
MP4
|
16.2 MB
|
|
|
006 Splay trees application_en.vtt
|
VTT
|
3.6 KB
|
|
|
006 Ternary search tree implementation III.mp4
|
MP4
|
37.7 MB
|
|
|
006 Ternary search tree implementation III_en.vtt
|
VTT
|
6.4 KB
|
|
|
006 Tries data structure implementation I.mp4
|
MP4
|
50.7 MB
|
|
|
006 Tries data structure implementation I_en.vtt
|
VTT
|
12.6 KB
|
|
|
007 Knuth-Morris-Pratt algorithm implementation.mp4
|
MP4
|
44.5 MB
|
|
|
007 Knuth-Morris-Pratt algorithm implementation_en.vtt
|
VTT
|
10.6 KB
|
|
|
007 Tries data structure implementation II.mp4
|
MP4
|
34.7 MB
|
|
|
007 Tries data structure implementation II_en.vtt
|
VTT
|
7.2 KB
|
|
|
008 Tries data structure implementation III.mp4
|
MP4
|
67.9 MB
|
|
|
008 Tries data structure implementation III_en.vtt
|
VTT
|
12 KB
|
|
|
008 Z algorithm introduction.mp4
|
MP4
|
68.1 MB
|
|
|
008 Z algorithm introduction_en.vtt
|
VTT
|
23.1 KB
|
|
|
009 Trie data structures as associative arrays.mp4
|
MP4
|
28.8 MB
|
|
|
009 Trie data structures as associative arrays_en.vtt
|
VTT
|
5 KB
|
|
|
009 Z algorithm illustration.mp4
|
MP4
|
39.7 MB
|
|
|
009 Z algorithm illustration_en.vtt
|
VTT
|
15.2 KB
|
|
|
010 Hashing based data structures and tries.mp4
|
MP4
|
27.4 MB
|
|
|
010 Hashing based data structures and tries_en.vtt
|
VTT
|
8.1 KB
|
|
|
010 Z algorithm implementation.mp4
|
MP4
|
69.9 MB
|
|
|
010 Z algorithm implementation_en.vtt
|
VTT
|
17.7 KB
|
|
|
011 Applications of trie data structures.mp4
|
MP4
|
27.7 MB
|
|
|
011 Applications of trie data structures_en.vtt
|
VTT
|
6.4 KB
|
|
|
011 Substring search algorithms comparison.mp4
|
MP4
|
22.4 MB
|
|
|
011 Substring search algorithms comparison_en.vtt
|
VTT
|
6.3 KB
|
|
|
012 Applications of substring search.mp4
|
MP4
|
14.2 MB
|
|
|
012 Applications of substring search_en.vtt
|
VTT
|
2.8 KB
|
|
|
BoggleGame.py
|
PY
|
4.3 KB
|
|
|
Bonus Resources.txt
|
TXT
|
409.6 B
|
|
|
CycleDetection.py
|
PY
|
1.2 KB
|
|
|
FenwickTree.py
|
PY
|
2.2 KB
|
|
|
Get Bonus Downloads Here.url
|
URL
|
204.8 B
|
|
|
KnuthMorrisPratt.py
|
PY
|
1.7 KB
|
|
|
LRUCache.py
|
PY
|
4.6 KB
|
|
|
NaiveSubstringSearch.py
|
PY
|
716.8 B
|
|
|
RabinKarp.py
|
PY
|
1.9 KB
|
|
|
SplayTree.py
|
PY
|
4.1 KB
|
|
|
TarjanAlgorithm.py
|
PY
|
2.3 KB
|
|
|
TernarySearchTree.py
|
PY
|
2.4 KB
|
|
|
TopologicalOrdering.py
|
PY
|
1.2 KB
|
|
|
TopologicalShortestPath.py
|
PY
|
2.3 KB
|
|
|
TravellingSalesmanProblem.py
|
PY
|
2.3 KB
|
|
|
Trie.py
|
PY
|
4.6 KB
|
|
|
TrieAssociativeArray.py
|
PY
|
3.1 KB
|
|
|
TrieLCP.py
|
PY
|
3.5 KB
|
|
|
ZAlgorithm.py
|
PY
|
1.9 KB
|
|
|
advanced_algorithms_python.pptx
|
PPTX
|
876.6 KB
|
|
|
boggle_game.pptx
|
PPTX
|
66.2 KB
|
|
|
boyer_moore.py
|
PY
|
1.9 KB
|
|
|
brute_force_substring.py
|
PY
|
614.4 B
|
|
|
fenwick_tree.py
|
PY
|
2.1 KB
|
|
|
graph_algorithms.pptx
|
PPTX
|
1.3 MB
|
|
|
knuth_morris_pratt.py
|
PY
|
1.6 KB
|
|
|
lru.py
|
PY
|
4.1 KB
|
|
|
meta_heuristics.pptx
|
PPTX
|
225.9 KB
|
|
|
splay_tree.pptx
|
PPTX
|
15.5 MB
|
|
|
substring_search.pptx
|
PPTX
|
1.2 MB
|
|
|
ternary_search_trees.pptx
|
PPTX
|
253.2 KB
|
|
|
trie.pptx
|
PPTX
|
497.3 KB
|
|
|
trie.py
|
PY
|
5.5 KB
|
|
|
trie_as_dictionary.py
|
PY
|
3 KB
|
|
|
tsp.pptx
|
PPTX
|
148.1 KB
|
|
|
tst_stack_memory.pptx
|
PPTX
|
148.2 KB
|
