Udemy - Advanced Algorithms and Data Structures in Python [Giga C...

Files:

• [CourseClub.ME].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• 001 Introduction.mp4 (11.2 MB)
• 001 Introduction_en.vtt (2.4 KB)

• 001 What are Fenwick trees.mp4 (45.6 MB)
• 001 What are Fenwick trees_en.vtt (13.2 KB)
• 002 Fenwick trees theory - tree structure.mp4 (17.7 MB)
• 002 Fenwick trees theory - tree structure_en.vtt (4.9 KB)
• 003 Fenwick trees theory - update.mp4 (30.6 MB)
• 003 Fenwick trees theory - update_en.vtt (9.0 KB)
• 004 Fenwick trees implementation I.mp4 (26.5 MB)
• 004 Fenwick trees implementation I_en.vtt (8.4 KB)
• 005 Fenwick trees implementation II.mp4 (42.4 MB)
• 005 Fenwick trees implementation II_en.vtt (9.6 KB)

• 001 Why to use cache.mp4 (17.8 MB)
• 001 Why to use cache_en.vtt (3.9 KB)
• 002 LRU cache illustration.mp4 (28.2 MB)
• 002 LRU cache illustration_en.vtt (8.9 KB)
• 003 LRU cache implementation I.mp4 (34.3 MB)
• 003 LRU cache implementation I_en.vtt (10.5 KB)
• 004 LRU cache implementation II.mp4 (44.6 MB)
• 004 LRU cache implementation II_en.vtt (11.0 KB)
• 005 LRU cache implementation III.mp4 (25.3 MB)
• 005 LRU cache implementation III_en.vtt (5.0 KB)
• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• 001 What are splay trees.mp4 (55.3 MB)
• 001 What are splay trees_en.vtt (15.9 KB)
• 002 Splay tree introduction - example.mp4 (10.6 MB)
• 002 Splay tree introduction - example_en.vtt (4.6 KB)
• 003 Splay trees implementation I.mp4 (27.6 MB)
• 003 Splay trees implementation I_en.vtt (7.8 KB)
• 004 Splay trees implementation II.mp4 (34.2 MB)
• 004 Splay trees implementation II_en.vtt (8.0 KB)
• 005 Splay trees implementation III.mp4 (54.4 MB)
• 005 Splay trees implementation III_en.vtt (9.9 KB)
• 006 Splay trees application.mp4 (16.2 MB)
• 006 Splay trees application_en.vtt (3.6 KB)

• 001 What is external memory.mp4 (38.6 MB)
• 001 What is external memory_en.vtt (9.7 KB)
• 002 Disk access times.mp4 (21.1 MB)
• 002 Disk access times_en.vtt (5.0 KB)
• 003 What are B-trees.mp4 (29.4 MB)
• 003 What are B-trees_en.vtt (9.5 KB)
• 004 B-tree introduction - insertion.mp4 (21.5 MB)
• 004 B-tree introduction - insertion_en.vtt (13.6 KB)
• 005 B-tree introduction - deletion.mp4 (15.3 MB)
• 005 B-tree introduction - deletion_en.vtt (7.9 KB)
• 006 B-tree variants and file systems.mp4 (23.0 MB)
• 006 B-tree variants and file systems_en.vtt (5.8 KB)

• 001 What are tries (prefix trees).mp4 (41.0 MB)
• 001 What are tries (prefix trees)_en.vtt (11.4 KB)
• 002 Prefix tree introduction - insertion and searching.mp4 (25.5 MB)
• 002 Prefix tree introduction - insertion and searching_en.vtt (11.4 KB)
• 003 Prefix tree introduction - sorting.mp4 (12.4 MB)
• 003 Prefix tree introduction - sorting_en.vtt (5.0 KB)
• 004 Prefix tree introduction - autocomplete.mp4 (12.5 MB)
• 004 Prefix tree introduction - autocomplete_en.vtt (4.5 KB)
• 005 Prefix tree introduction - associative arrays.mp4 (11.5 MB)
• 005 Prefix tree introduction - associative arrays_en.vtt (5.8 KB)
• 006 Tries data structure implementation I.mp4 (50.7 MB)
• 006 Tries data structure implementation I_en.vtt (12.6 KB)
• 007 Tries data structure implementation II.mp4 (34.7 MB)
• 007 Tries data structure implementation II_en.vtt (7.2 KB)
• 008 Tries data structure implementation III.mp4 (67.9 MB)
• 008 Tries data structure implementation III_en.vtt (12.0 KB)
• 009 Trie data structures as associative arrays.mp4 (28.8 MB)
• 009 Trie data structures as associative arrays_en.vtt (5.0 KB)
• 010 Hashing based data structures and tries.mp4 (27.4 MB)
• 010 Hashing based data structures and tries_en.vtt (8.1 KB)
• 011 Applications of trie data structures.mp4 (27.7 MB)
• 011 Applications of trie data structures_en.vtt (6.4 KB)
• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• 001 Networking and the longest common prefix problem.mp4 (28.6 MB)
• 001 Networking and the longest common prefix problem_en.vtt (8.8 KB)
• 002 Longest common prefix implementation.mp4 (44.6 MB)
• 002 Longest common prefix implementation_en.vtt (8.8 KB)

• 001 What are ternary search trees.mp4 (27.0 MB)
• 001 What are ternary search trees_en.vtt (7.6 KB)
• 002 Ternary search tree visualization.mp4 (25.3 MB)
• 002 Ternary search tree visualization_en.vtt (12.7 KB)
• 003 Ternary search tree implementation I.mp4 (35.4 MB)
• 003 Ternary search tree implementation I_en.vtt (7.7 KB)
• 004 Recursion and stack memory visualization.mp4 (35.7 MB)
• 004 Recursion and stack memory visualization_en.vtt (9.7 KB)
• 005 Ternary search tree implementation II.mp4 (28.8 MB)
• 005 Ternary search tree implementation II_en.vtt (6.2 KB)
• 006 Ternary search tree implementation III.mp4 (37.7 MB)
• 006 Ternary search tree implementation III_en.vtt (6.4 KB)

• 001 What is boggle and how to solve it.mp4 (23.7 MB)
• 001 What is boggle and how to solve it_en.vtt (8.6 KB)
• 002 Boggle game with ternary search tree implementation I.mp4 (38.9 MB)
• 002 Boggle game with ternary search tree implementation I_en.vtt (8.3 KB)
• 003 Boggle game with ternary search tree implementation II.mp4 (65.5 MB)
• 003 Boggle game with ternary search tree implementation II_en.vtt (13.5 KB)
• 004 Boggle game with ternary search tree implementation III.mp4 (22.7 MB)
• 004 Boggle game with ternary search tree implementation III_en.vtt (3.8 KB)
• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• 001 Brute-force search introduction.mp4 (21.4 MB)
• 001 Brute-force search introduction_en.vtt (8.6 KB)
• 002 Brute-force substring search algorithm implementation.mp4 (24.5 MB)
• 002 Brute-force substring search algorithm implementation_en.vtt (7.5 KB)
• 003 Rabin-Karp algorithm introduction.mp4 (65.6 MB)
• 003 Rabin-Karp algorithm introduction_en.vtt (24.6 KB)
• 004 Rabin-Karp algorithm implementation.mp4 (67.1 MB)
• 004 Rabin-Karp algorithm implementation_en.vtt (17.3 KB)
• 005 Knuth-Morris-Pratt algorithm introduction.mp4 (41.2 MB)
• 005 Knuth-Morris-Pratt algorithm introduction_en.vtt (16.0 KB)
• 006 Constructing the partial match table - visualization.mp4 (31.1 MB)
• 006 Constructing the partial match table - visualization_en.vtt (10.3 KB)
• 007 Knuth-Morris-Pratt algorithm implementation.mp4 (44.5 MB)
• 007 Knuth-Morris-Pratt algorithm implementation_en.vtt (10.6 KB)
• 008 Z algorithm introduction.mp4 (68.1 MB)
• 008 Z algorithm introduction_en.vtt (23.1 KB)
• 009 Z algorithm illustration.mp4 (39.7 MB)
• 009 Z algorithm illustration_en.vtt (15.2 KB)
• 010 Z algorithm implementation.mp4 (69.9 MB)
• 010 Z algorithm implementation_en.vtt (17.7 KB)
• 011 Substring search algorithms comparison.mp4 (22.4 MB)
• 011 Substring search algorithms comparison_en.vtt (6.3 KB)
• 012 Applications of substring search.mp4 (14.2 MB)
• 012 Applications of substring search_en.vtt (2.8 KB)

• 001 What is topological ordering.mp4 (57.4 MB)
• 001 What is topological ordering_en.vtt (15.7 KB)
• 002 Topological ordering implementation.mp4 (39.6 MB)
• 002 Topological ordering implementation_en.vtt (10.3 KB)
• 003 Finding the shortest path with topological ordering.mp4 (24.6 MB)
• 003 Finding the shortest path with topological ordering_en.vtt (7.9 KB)
• 004 Topological ordering shortest path implementation I.mp4 (33.2 MB)
• 004 Topological ordering shortest path implementation I_en.vtt (10.2 KB)
• 005 Topological ordering shortest path implementation II.mp4 (38.5 MB)
• 005 Topological ordering shortest path implementation II_en.vtt (9.1 KB)
• 006 Dynamic programming with topological sort.mp4 (38.3 MB)
• 006 Dynamic programming with topological sort_en.vtt (10.1 KB)

• 001 Cycle detection introduction.mp4 (36.0 MB)
• 001 Cycle detection introduction_en.vtt (11.1 KB)
• 002 Cycle detection implementation.mp4 (38.7 MB)
• 002 Cycle detection implementation_en.vtt (11.2 KB)

• 001 Tarjan algorithm introduction.mp4 (35.7 MB)
• 001 Tarjan algorithm introduction_en.vtt (11.8 KB)
• 002 Tarjan algorithm visualization.mp4 (23.7 MB)
• 002 Tarjan algorithm visualization_en.vtt (11.7 KB)
• 003 Tarjan algorithm implementation.mp4 (56.5 MB)
• 003 Tarjan algorithm implementation_en.vtt (14.4 KB)
• 004 Applications of strongly connected components.mp4 (46.3 MB)
• 004 Applications of strongly connected components_en.vtt (9.4 KB)
• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• 001 What are Hamiltonian cycles.mp4 (40.6 MB)
• 001 What are Hamiltonian cycles_en.vtt (14.0 KB)
• 002 The travelling salesman problem.mp4 (9.7 MB)
• 002 The travelling salesman problem_en.vtt (3.3 KB)
• 003 Travelling salesman problem implementation.mp4 (102.5 MB)
• 003 Travelling salesman problem implementation_en.vtt (21.0 KB)
• 004 TSP and stack memory visualization.mp4 (47.7 MB)
• 004 TSP and stack memory visualization_en.vtt (16.3 KB)
• 005 Why to use meta-heuristics.mp4 (20.2 MB)
• 005 Why to use meta-heuristics_en.vtt (6.9 KB)

• 001 Eulerian cycles introduction.mp4 (37.4 MB)
• 001 Eulerian cycles introduction_en.vtt (10.9 KB)
• 002 Eulerian cycles applications.mp4 (7.3 MB)
• 002 Eulerian cycles applications_en.vtt (1.8 KB)

• 001 Algorithms Visualization App.mp4 (13.7 MB)
• 001 Algorithms Visualization App_en.vtt (0.0 KB)
• 002 Algorhyme - Algorithms and Data Structures.html (1.9 KB)

• 001 Course materials.html (0.1 KB)
• 38850814-advanced-python.zip (19.2 MB)
• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)

• [CourseClub.Me].url (0.1 KB)
• [GigaCourse.Com].url (0.0 KB)