FreeCourseLab com Udemy - From 0 to 1 Data Structures & Algorithms in Java

1. 1. What this course is about/1. You, This course and Us.mp419.63MB
2. 10. Heaps/1. The Heap Is Just The Best Way to Implement a Priority Queue.mp450.66MB
3. 10. Heaps/2. Meet The Binary Heap - It's A Tree At Heart.mp437.28MB
4. 10. Heaps/3. The Binary Heap - Logically A Tree Really An Array.mp432.29MB
5. 10. Heaps/4. The Binary Heap - Making It Real With Code.mp418.43MB
6. 10. Heaps/5. Heapify!.mp451.09MB
7. 10. Heaps/6. Insert And Remove From A Heap.mp436.67MB
8. 11. Revisiting Sorting - The Heap Sort/1. Heap Sort Phase I - Heapify.mp444.15MB
9. 11. Revisiting Sorting - The Heap Sort/2. Heap Sort Phase II - The Actual Sort.mp434.87MB
10. 12. Heap Problems/1. Maximum Element In A Minimum Heap and K Largest Elements In A Stream.mp436.05MB
11. 13. Graphs/1. Introducing The Graph.mp440.15MB
12. 13. Graphs/2. Types Of Graphs.mp413.68MB
13. 13. Graphs/3. The Directed And Undirected Graph.mp427.14MB
14. 13. Graphs/4. Representing A Graph In Code.mp416.93MB
15. 13. Graphs/5. Graph Using An Adjacency Matrix.mp437.68MB
16. 13. Graphs/6. Graph Using An Adjacency List And Adjacency Set.mp435.57MB
17. 13. Graphs/7. Comparison Of Graph Representations.mp419.39MB
18. 13. Graphs/8. Graph Traversal - Depth First And Breadth First.mp436.73MB
19. 14. Graph Algorithms/1. Topological Sort In A Graph.mp436.2MB
20. 14. Graph Algorithms/2. Implementation Of Topological Sort.mp414.62MB
21. 15. Shortest Path Algorithms/1. Introduction To Shortest Path In An Unweighted Graph - The Distance Table.mp425.61MB
22. 15. Shortest Path Algorithms/10. Dealing With Negative Cycles In The Bellman Ford Algorithm.mp417.3MB
23. 15. Shortest Path Algorithms/11. Implementation Of The Bellman Ford Algorithm.mp415MB
24. 15. Shortest Path Algorithms/2. The Shortest Path Algorithm Visualized.mp429.09MB
25. 15. Shortest Path Algorithms/3. Implementation Of The Shortest Path In An Unweighted Graph.mp413.57MB
26. 15. Shortest Path Algorithms/4. Introduction To The Weighted Graph.mp47.1MB
27. 15. Shortest Path Algorithms/5. Shortest Path In A Weighted Graph - A Greedy Algorithm.mp437.46MB
28. 15. Shortest Path Algorithms/6. Dijkstra's Algorithm Visualized.mp428.81MB
29. 15. Shortest Path Algorithms/7. Implementation Of Dijkstra's Algorithm.mp417.69MB
30. 15. Shortest Path Algorithms/8. Introduction To The Bellman Ford Algorithm.mp419.88MB
31. 15. Shortest Path Algorithms/9. The Bellman Ford Algorithm Visualized.mp426.7MB
32. 16. Spanning Tree Algorithms/1. Prim's Algorithm For a Minimal Spanning Tree.mp437.87MB
33. 16. Spanning Tree Algorithms/2. Use Cases And Implementation Of Prim's Algorithm.mp421.68MB
34. 16. Spanning Tree Algorithms/3. Kruskal's Algorithm For a Minimal Spanning Tree.mp419.72MB
35. 16. Spanning Tree Algorithms/4. Implementation Of Kruskal's Algorithm.mp416.37MB
36. 17. Graph Problems/1. Design A Course Schedule Considering Pre-reqs For Courses.mp426.94MB
37. 17. Graph Problems/2. Find The Shortest Path In A Weighted Graphs - Fewer Edges Better.mp433.66MB
38. 2. Data Structures And Algorithms - A Symbiotic Relationship/1. Why are Data Structures And Algorithms important.mp440.87MB
39. 3. Complexity Analysis and the Big-O Notation/1. Performance and Complexity.mp437.9MB
40. 3. Complexity Analysis and the Big-O Notation/2. The Big-O Notation.mp430.87MB
41. 3. Complexity Analysis and the Big-O Notation/3. What is the complexity of these pieces of code.mp439.28MB
42. 4. Linked Lists/1. The Linked List - The Most Basic Of All Data Structures.mp436.73MB
43. 4. Linked Lists/2. Linked List Problems.mp420.16MB
44. 4. Linked Lists/3. Linked Lists vs Arrays.mp426.91MB
45. 5. Stacks And Queues/1. Meet The Stack - Simple But Powerful.mp430.64MB
46. 5. Stacks And Queues/2. Building A Stack Using Java.mp433.33MB
47. 5. Stacks And Queues/3. Match Parenthesis To Check A Well Formed Expression.mp426.09MB
48. 5. Stacks And Queues/4. Find The Minimum Element In A Stack In Constant Time.mp421.73MB
49. 5. Stacks And Queues/5. Meet The Queue - A Familiar Sight In Everyday Life.mp429.23MB
50. 5. Stacks And Queues/6. The Circular Queue - Tricky But Fast.mp438.71MB
51. 5. Stacks And Queues/7. Build A Queue With Two Stacks.mp437.48MB
52. 6. Sorting and Searching/1. Sorting Trade-Offs.mp429.09MB
53. 6. Sorting and Searching/2. Selection Sort.mp428.57MB
54. 6. Sorting and Searching/3. Bubble Sort.mp429.91MB
55. 6. Sorting and Searching/4. Insertion Sort.mp432.93MB
56. 6. Sorting and Searching/5. Shell Sort.mp429.68MB
57. 6. Sorting and Searching/6. Merge Sort.mp441.34MB
58. 6. Sorting and Searching/7. Quick Sort.mp430.09MB
59. 6. Sorting and Searching/8. Binary Search - search quickly through a sorted list.mp420.06MB
60. 7. Binary Trees/1. Meet The Binary Tree - A Hierarchical Data Structure.mp436.15MB
61. 7. Binary Trees/2. Breadth First Traversal.mp441.52MB
62. 7. Binary Trees/3. Depth First - Pre-OrderTraversal.mp437.85MB
63. 7. Binary Trees/4. Depth First - In-Order and Post-Order Traversal.mp434.52MB
64. 8. Binary Search Trees/1. The Binary Search Tree - an introduction.mp426.01MB
65. 8. Binary Search Trees/2. Insertion and Lookup in a Binary Search Tree.mp439.16MB
66. 9. Binary Tree Problems/1. Minimum Value, Maximum Depth And Mirror.mp434.71MB
67. 9. Binary Tree Problems/2. Count Trees, Print Range and Is BST.mp441.34MB