本站已收录 番号和无损神作磁力链接/BT种子 

[GigaCourse.Com] Udemy - Algorithms and Data Structures in Python (INTERVIEW Q&A)

种子简介

种子名称: [GigaCourse.Com] Udemy - Algorithms and Data Structures in Python (INTERVIEW Q&A)
文件类型: 视频
文件数目: 156个文件
文件大小: 4.13 GB
收录时间: 2023-9-24 16:31
已经下载: 3
资源热度: 131
最近下载: 2024-5-31 01:31

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:361e12041418726b94aa3a11462a5f00530103b7&dn=[GigaCourse.Com] Udemy - Algorithms and Data Structures in Python (INTERVIEW Q&A) 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[GigaCourse.Com] Udemy - Algorithms and Data Structures in Python (INTERVIEW Q&A).torrent
  • 1. Introduction/1. Introduction.mp418.02MB
  • 10. Data Structures - Queues/1. What are queues.mp410.54MB
  • 10. Data Structures - Queues/2. Queue implementation.mp425.37MB
  • 11. Interview Questions (Stacks and Queues)/1. Max in a stack problem solution.mp430.52MB
  • 11. Interview Questions (Stacks and Queues)/2. Queue with stack problem solution.mp423.52MB
  • 11. Interview Questions (Stacks and Queues)/3. Queue with stack problem solution - recursion.mp424.68MB
  • 12. Data Structures - Binary Search Trees/1. What are binary search trees.mp441.5MB
  • 12. Data Structures - Binary Search Trees/10. Binary Search Tree implementation III.mp471.82MB
  • 12. Data Structures - Binary Search Trees/11. Practical (real-world) applications of trees.mp412.83MB
  • 12. Data Structures - Binary Search Trees/2. Binary search trees theory - search, insert.mp413.19MB
  • 12. Data Structures - Binary Search Trees/3. Binary search trees theory - delete.mp412.73MB
  • 12. Data Structures - Binary Search Trees/4. Binary search trees theory - in-order traversal.mp414.39MB
  • 12. Data Structures - Binary Search Trees/5. Binary search trees theory - running times.mp47.4MB
  • 12. Data Structures - Binary Search Trees/6. Binary search tree implementation I.mp425.09MB
  • 12. Data Structures - Binary Search Trees/7. Binary Search Tree implementation II.mp435.41MB
  • 12. Data Structures - Binary Search Trees/8. Stack memory visualization - finding max (min) items.mp411.79MB
  • 12. Data Structures - Binary Search Trees/9. Stack memory visualization - tree traversal.mp417.15MB
  • 13. Interview Questions (Binary Search Trees)/1. Compare binary trees solution.mp435.59MB
  • 14. Data Structures - AVL Trees/1. Motivation behind balanced binary search trees.mp48.19MB
  • 14. Data Structures - AVL Trees/10. AVL tree implementation V.mp47.07MB
  • 14. Data Structures - AVL Trees/11. Practical (real-world) applications of balanced binary search trees.mp415.45MB
  • 14. Data Structures - AVL Trees/2. What are AVL trees.mp416.36MB
  • 14. Data Structures - AVL Trees/3. AVL trees introduction - height.mp438.94MB
  • 14. Data Structures - AVL Trees/4. AVL trees introduction - rotations.mp422.49MB
  • 14. Data Structures - AVL Trees/5. AVL trees introduction - illustration.mp49.11MB
  • 14. Data Structures - AVL Trees/6. AVL tree implementation I.mp427.64MB
  • 14. Data Structures - AVL Trees/7. AVL tree implementation II.mp441.86MB
  • 14. Data Structures - AVL Trees/8. AVL tree implementation III.mp496.54MB
  • 14. Data Structures - AVL Trees/9. AVL tree implementation IV.mp4129.99MB
  • 15. Data Structures - Red-Black Trees/1. What are red-black trees.mp429.66MB
  • 15. Data Structures - Red-Black Trees/2. The logic behind red-black trees.mp420.45MB
  • 15. Data Structures - Red-Black Trees/3. Red-black trees - recoloring and rotation cases.mp421.03MB
  • 15. Data Structures - Red-Black Trees/4. Red-black tree illustrations.mp412.74MB
  • 15. Data Structures - Red-Black Trees/5. Red-black tree implementation I.mp418.46MB
  • 15. Data Structures - Red-Black Trees/6. Red-black tree implementation II.mp415.85MB
  • 15. Data Structures - Red-Black Trees/7. Red-black tree implementation III.mp473.47MB
  • 15. Data Structures - Red-Black Trees/8. Red-black tree implementation IV.mp416.25MB
  • 15. Data Structures - Red-Black Trees/9. Differences between red-black tree and AVL trees.mp47.86MB
  • 16. Data Structures - Heaps/1. What are priority queues.mp412.81MB
  • 16. Data Structures - Heaps/10. Heap implementation III.mp438.29MB
  • 16. Data Structures - Heaps/11. Heaps in Python.mp411.94MB
  • 16. Data Structures - Heaps/2. Heap introduction - basics.mp429.21MB
  • 16. Data Structures - Heaps/3. Heap introduction - array representation.mp418.86MB
  • 16. Data Structures - Heaps/4. Heap introduction - remove operation.mp417.96MB
  • 16. Data Structures - Heaps/5. Using heap data structure to sort (heapsort).mp412.32MB
  • 16. Data Structures - Heaps/6. Heap introduction - operations complexities.mp439.86MB
  • 16. Data Structures - Heaps/7. Binomial and Fibonacci heaps.mp417.98MB
  • 16. Data Structures - Heaps/8. Heap implementation I.mp418.17MB
  • 16. Data Structures - Heaps/9. Heap implementation II.mp475.95MB
  • 17. Interview Questions (Heaps)/1. Interview question #1 - solution.mp420.26MB
  • 17. Interview Questions (Heaps)/2. Interview question #2 - solution.mp427.72MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/1. What are associative arrays.mp417.99MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/2. Hashtable introduction - basics.mp442.34MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/3. Hashtable introduction - collisions.mp448.53MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/4. Hashtable introduction - dynamic resizing.mp434.03MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/5. Linear probing implementation I.mp424.62MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/6. Linear probing implementation II.mp455.58MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/7. Linear probing implementation III.mp412.6MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/8. Dictionaires in Python.mp411.59MB
  • 18. Data Structures - Associative Arrays (Dictionaries)/9. Practical (real-world) applications of hashing.mp420.91MB
  • 19. Graph Algorithms Overview/1. Graph theory overview.mp412.74MB
  • 19. Graph Algorithms Overview/2. Adjacency matrix and adjacency list.mp418.98MB
  • 19. Graph Algorithms Overview/3. Applications of graphs.mp412.99MB
  • 2. Data Structures Overview/1. Why to use data structures.mp422.35MB
  • 2. Data Structures Overview/2. Data structures and abstract data types.mp414.19MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/1. Breadth-first search introduction.mp437.73MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/2. Breadth-first search implementation.mp425.66MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/3. What are WebCrawlers (core of search engines).mp431.38MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/4. WebCrawler basic implementation.mp443.17MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/5. Depth-first search introduction.mp431.24MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/6. Depth-first search implementation.mp422.69MB
  • 20. Graph Algorithms - Graph Traversal Algorithms/7. Memory management BFS vs DFS.mp429.76MB
  • 21. Interview Questions (Graph Traversal)/1. Interview question #1 - solution.mp49.82MB
  • 21. Interview Questions (Graph Traversal)/2. Depth-first search and stack memory visualisation.mp413.67MB
  • 21. Interview Questions (Graph Traversal)/3. Interview question #2 - solution.mp479.46MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/1. What is the shortest path problem.mp414.2MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/2. Dijkstra algorithm visualization.mp428.43MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/3. Dijkstra algorithm implementation I - Edge, Node.mp438.1MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/4. Dijkstra algorithm implementation II - algorithm.mp473.77MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/5. Dijkstra algorithm implementation III - testing.mp436.45MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/6. Dijktsra's algorithm with adjacency matrix representation.mp424.29MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/7. Adjacency matrix representation implementation.mp478.91MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/8. Shortest path algorithms applications.mp418.48MB
  • 22. Graph Algorithms - Shortest Paths with Dijkstra's Algorithm/9. What is the critical path method (CPM).mp413.7MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/1. What is the Bellman-Ford algorithm.mp443.39MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/2. Bellman-Ford algorithm visualization.mp410.7MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/3. Bellman-Ford algorithm implementation I - Node, Edge.mp44.89MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/4. Bellman-Ford algorithm implementation II - the algorithm.mp450.42MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/5. Bellman-Ford algorithm implementation III - testing.mp419.56MB
  • 23. Graph Algorithms - Shortest Paths with Bellman-Ford Algorithm/6. Greedy algorithm or dynamic programming approach.mp434.18MB
  • 24. Interview Questions (Shortest Paths)/1. How to use Bellman-Ford algorithm on the FOREX.mp416.5MB
  • 24. Interview Questions (Shortest Paths)/2. Interview question #1 - solution.mp420.84MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/1. What is the disjoint set data structure.mp439.56MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/2. Disjoint sets visualization.mp410.56MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/3. Kruskal's algorithm introduction.mp455.13MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/4. Kruskal algorithm implementation I - basic classes.mp419.71MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/5. Kruskal algorithm implementation II - disjoint set.mp462.66MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/6. Kruskal algorithm implementation III - algorithm.mp422.75MB
  • 25. Graph Algorithms - Spanning Trees with Kruskal Algorithm/7. Kruskal algorithm implementation VI - testing.mp416.2MB
  • 26. Graph Algorithms - Spanning Trees with Prims Algorithm/1. What is the Prim-Jarnik algorithm.mp425.59MB
  • 26. Graph Algorithms - Spanning Trees with Prims Algorithm/2. Prims-Jarnik algorithm implementation I.mp483.38MB
  • 26. Graph Algorithms - Spanning Trees with Prims Algorithm/3. Prims-Jarnik algorithm implementation II.mp431.64MB
  • 26. Graph Algorithms - Spanning Trees with Prims Algorithm/4. Applications of spanning trees.mp429.45MB
  • 27. Basic Sorting Algorithms/1. Sorting introduction.mp425.75MB
  • 27. Basic Sorting Algorithms/10. Insertion sort introduction.mp422.63MB
  • 27. Basic Sorting Algorithms/11. Insertion sort implementation.mp415.35MB
  • 27. Basic Sorting Algorithms/12. Shell sort introduction.mp411.95MB
  • 27. Basic Sorting Algorithms/13. Shell sort implementation.mp415.03MB
  • 27. Basic Sorting Algorithms/14. Quicksort introduction.mp434MB
  • 27. Basic Sorting Algorithms/15. Quicksort introduction - example.mp441.3MB
  • 27. Basic Sorting Algorithms/16. Quicksort implementation.mp438.21MB
  • 27. Basic Sorting Algorithms/17. What is the worst-case scenario for quicksort.mp418.51MB
  • 27. Basic Sorting Algorithms/18. Merge sort introduction.mp419.57MB
  • 27. Basic Sorting Algorithms/19. Merge sort implementation.mp427.28MB
  • 27. Basic Sorting Algorithms/2. What is stability in sorting.mp417.08MB
  • 27. Basic Sorting Algorithms/20. Stack memory and merge sort visualization.mp418.56MB
  • 27. Basic Sorting Algorithms/21. Hybrid algorithms introduction.mp419.11MB
  • 27. Basic Sorting Algorithms/22. Non-comparison based algorithms.mp45.48MB
  • 27. Basic Sorting Algorithms/23. Counting sort introduction.mp435.52MB
  • 27. Basic Sorting Algorithms/24. Counting sort implementation.mp432.01MB
  • 27. Basic Sorting Algorithms/25. Radix sort introduction.mp450.5MB
  • 27. Basic Sorting Algorithms/26. Radix sort implementation.mp447.74MB
  • 27. Basic Sorting Algorithms/3. What is adaptive sorting.mp419.42MB
  • 27. Basic Sorting Algorithms/4. Bogo sort introduction.mp47.71MB
  • 27. Basic Sorting Algorithms/5. Bogo sort implementation.mp446.55MB
  • 27. Basic Sorting Algorithms/6. Bubble sort introduction.mp412.54MB
  • 27. Basic Sorting Algorithms/7. Bubble sort implementation.mp414.71MB
  • 27. Basic Sorting Algorithms/8. Selection sort introduction.mp430.08MB
  • 27. Basic Sorting Algorithms/9. Selection sort implementation.mp414.23MB
  • 31. Algorhyme FREE Algorithms Visualizer App/1. Algorithms Visualization App.mp47.44MB
  • 4. Data Structures - Arrays/1. What are array data structures.mp425MB
  • 4. Data Structures - Arrays/2. Arrays introduction - operations.mp424.95MB
  • 4. Data Structures - Arrays/3. Arrays in Python.mp425.93MB
  • 4. Data Structures - Arrays/4. What are real arrays in Python.mp416.84MB
  • 5. Interview Questions (Arrays)/1. Reversing an array in-place solution.mp410.24MB
  • 5. Interview Questions (Arrays)/2. Palindrome problem solution.mp423.81MB
  • 5. Interview Questions (Arrays)/3. Integer reversion problem solution.mp422.2MB
  • 5. Interview Questions (Arrays)/4. Anagram problem solution.mp417.95MB
  • 5. Interview Questions (Arrays)/5. Duplicates in an array problem solution.mp431.55MB
  • 6. Data Structures - Linked Lists/1. What are linked lists.mp419.08MB
  • 6. Data Structures - Linked Lists/2. Linked list introduction - operations.mp433.41MB
  • 6. Data Structures - Linked Lists/3. Linked list implementation I.mp427.5MB
  • 6. Data Structures - Linked Lists/4. Linked list implementation II.mp414.46MB
  • 6. Data Structures - Linked Lists/5. Linked list implementation III.mp429.86MB
  • 6. Data Structures - Linked Lists/6. Comparing linked lists and arrays.mp414.42MB
  • 6. Data Structures - Linked Lists/7. Practical (real-world) applications of linked lists.mp436.46MB
  • 7. Data Structures - Doubly Linked Lists/1. What are doubly linked lists.mp429.5MB
  • 7. Data Structures - Doubly Linked Lists/2. Doubly linked list implementation.mp439.49MB
  • 7. Data Structures - Doubly Linked Lists/3. Running time comparison linked lists and arrays.mp415.09MB
  • 8. Interview Questions (Linked Lists)/1. Finding the middle node in a linked list solution.mp418.9MB
  • 8. Interview Questions (Linked Lists)/2. Reverse a linked list in-place solution.mp428.12MB
  • 9. Data Structures - Stacks/1. What are stacks.mp410.57MB
  • 9. Data Structures - Stacks/2. Stacks in memory management (stacks and heaps ).mp48.89MB
  • 9. Data Structures - Stacks/3. Stack memory visualization.mp416.53MB
  • 9. Data Structures - Stacks/4. Stack implementation.mp425.33MB
  • 9. Data Structures - Stacks/5. Practical (real-world) applications of stacks.mp416.11MB