FreeCourseSite com Udemy - Advanced Algorithms and Data Structures in Python

1. 01 - Introduction/001 Introduction.mp411.25MB
2. 02 - Fenwick Trees (Binary Indexed Trees)/001 What are Fenwick trees.mp445.63MB
3. 02 - Fenwick Trees (Binary Indexed Trees)/002 Fenwick trees theory - tree structure.mp417.65MB
4. 02 - Fenwick Trees (Binary Indexed Trees)/003 Fenwick trees theory - update.mp430.62MB
5. 02 - Fenwick Trees (Binary Indexed Trees)/004 Fenwick trees implementation I.mp426.55MB
6. 02 - Fenwick Trees (Binary Indexed Trees)/005 Fenwick trees implementation II.mp442.45MB
7. 03 - LRU Caches/001 Why to use cache.mp417.85MB
8. 03 - LRU Caches/002 LRU cache illustration.mp428.19MB
9. 03 - LRU Caches/003 LRU cache implementation I.mp434.3MB
10. 03 - LRU Caches/004 LRU cache implementation II.mp444.59MB
11. 03 - LRU Caches/005 LRU cache implementation III.mp425.28MB
12. 04 - Splay Tree Data Structure/001 What are splay trees.mp455.34MB
13. 04 - Splay Tree Data Structure/002 Splay tree introduction - example.mp410.64MB
14. 04 - Splay Tree Data Structure/003 Splay trees implementation I.mp427.57MB
15. 04 - Splay Tree Data Structure/004 Splay trees implementation II.mp434.19MB
16. 04 - Splay Tree Data Structure/005 Splay trees implementation III.mp454.43MB
17. 04 - Splay Tree Data Structure/006 Splay trees application.mp416.15MB
18. 05 - B-Trees/001 What is external memory.mp438.64MB
19. 05 - B-Trees/002 Disk access times.mp421.09MB
20. 05 - B-Trees/003 What are B-trees.mp429.41MB
21. 05 - B-Trees/004 B-tree introduction - insertion.mp421.51MB
22. 05 - B-Trees/005 B-tree introduction - deletion.mp415.35MB
23. 05 - B-Trees/006 B-tree variants and file systems.mp423MB
24. 06 - Trie Data Structures (Prefix Trees)/001 What are tries (prefix trees).mp441MB
25. 06 - Trie Data Structures (Prefix Trees)/002 Prefix tree introduction - insertion and searching.mp425.5MB
26. 06 - Trie Data Structures (Prefix Trees)/003 Prefix tree introduction - sorting.mp412.43MB
27. 06 - Trie Data Structures (Prefix Trees)/004 Prefix tree introduction - autocomplete.mp412.53MB
28. 06 - Trie Data Structures (Prefix Trees)/005 Prefix tree introduction - associative arrays.mp411.46MB
29. 06 - Trie Data Structures (Prefix Trees)/006 Tries data structure implementation I.mp450.7MB
30. 06 - Trie Data Structures (Prefix Trees)/007 Tries data structure implementation II.mp434.72MB
31. 06 - Trie Data Structures (Prefix Trees)/008 Tries data structure implementation III.mp467.93MB
32. 06 - Trie Data Structures (Prefix Trees)/009 Trie data structures as associative arrays.mp428.79MB
33. 06 - Trie Data Structures (Prefix Trees)/010 Hashing based data structures and tries.mp427.42MB
34. 06 - Trie Data Structures (Prefix Trees)/011 Applications of trie data structures.mp427.73MB
35. 07 - Interview Questions - IP Routing with Tries/001 Networking and the longest common prefix problem.mp428.56MB
36. 07 - Interview Questions - IP Routing with Tries/002 Longest common prefix implementation.mp444.64MB
37. 08 - Ternary Search Trees/001 What are ternary search trees.mp426.99MB
38. 08 - Ternary Search Trees/002 Ternary search tree visualization.mp425.31MB
39. 08 - Ternary Search Trees/003 Ternary search tree implementation I.mp435.39MB
40. 08 - Ternary Search Trees/004 Recursion and stack memory visualization.mp435.68MB
41. 08 - Ternary Search Trees/005 Ternary search tree implementation II.mp428.81MB
42. 08 - Ternary Search Trees/006 Ternary search tree implementation III.mp437.67MB
43. 09 - Interview Questions - Boggle Game/001 What is boggle and how to solve it.mp423.68MB
44. 09 - Interview Questions - Boggle Game/002 Boggle game with ternary search tree implementation I.mp438.95MB
45. 09 - Interview Questions - Boggle Game/003 Boggle game with ternary search tree implementation II.mp465.55MB
46. 09 - Interview Questions - Boggle Game/004 Boggle game with ternary search tree implementation III.mp422.72MB
47. 10 - Substring Search Algorithms/001 Brute-force search introduction.mp421.41MB
48. 10 - Substring Search Algorithms/002 Brute-force substring search algorithm implementation.mp424.46MB
49. 10 - Substring Search Algorithms/003 Rabin-Karp algorithm introduction.mp465.59MB
50. 10 - Substring Search Algorithms/004 Rabin-Karp algorithm implementation.mp467.08MB
51. 10 - Substring Search Algorithms/005 Knuth-Morris-Pratt algorithm introduction.mp441.24MB
52. 10 - Substring Search Algorithms/006 Constructing the partial match table - visualization.mp431.14MB
53. 10 - Substring Search Algorithms/007 Knuth-Morris-Pratt algorithm implementation.mp444.49MB
54. 10 - Substring Search Algorithms/008 Z algorithm introduction.mp468.12MB
55. 10 - Substring Search Algorithms/009 Z algorithm illustration.mp439.74MB
56. 10 - Substring Search Algorithms/010 Z algorithm implementation.mp469.95MB
57. 10 - Substring Search Algorithms/011 Substring search algorithms comparison.mp422.45MB
58. 10 - Substring Search Algorithms/012 Applications of substring search.mp414.2MB
59. 11 - Topological Ordering/001 What is topological ordering.mp457.41MB
60. 11 - Topological Ordering/002 Topological ordering implementation.mp439.64MB
61. 11 - Topological Ordering/003 Finding the shortest path with topological ordering.mp424.58MB
62. 11 - Topological Ordering/004 Topological ordering shortest path implementation I.mp433.21MB
63. 11 - Topological Ordering/005 Topological ordering shortest path implementation II.mp438.48MB
64. 11 - Topological Ordering/006 Dynamic programming with topological sort.mp438.25MB
65. 12 - Cycle Detection/001 Cycle detection introduction.mp436.01MB
66. 12 - Cycle Detection/002 Cycle detection implementation.mp438.71MB
67. 13 - Strongly Connected Components (Tarjan's Algorithm)/001 Tarjan algorithm introduction.mp435.69MB
68. 13 - Strongly Connected Components (Tarjan's Algorithm)/002 Tarjan algorithm visualization.mp423.69MB
69. 13 - Strongly Connected Components (Tarjan's Algorithm)/003 Tarjan algorithm implementation.mp456.54MB
70. 13 - Strongly Connected Components (Tarjan's Algorithm)/004 Applications of strongly connected components.mp446.27MB
71. 14 - Hamiltonian Cycles - Travelling Salesman Problem/001 What are Hamiltonian cycles.mp440.58MB
72. 14 - Hamiltonian Cycles - Travelling Salesman Problem/002 The travelling salesman problem.mp49.67MB
73. 14 - Hamiltonian Cycles - Travelling Salesman Problem/003 Travelling salesman problem implementation.mp4102.51MB
74. 14 - Hamiltonian Cycles - Travelling Salesman Problem/004 TSP and stack memory visualization.mp447.74MB
75. 14 - Hamiltonian Cycles - Travelling Salesman Problem/005 Why to use meta-heuristics.mp420.2MB
76. 15 - Eulerian Cycles - Chinese Postman Problem/001 Eulerian cycles introduction.mp437.36MB
77. 15 - Eulerian Cycles - Chinese Postman Problem/002 Eulerian cycles applications.mp47.29MB
78. 16 - Algorhyme FREE Algorithms Visualizer App/001 Algorithms Visualization App.mp413.7MB