Data Structures and Algorithms in JavaScript

1. 9. Binary Trees/5. BST Review and Scping Discussion.mp481.23MB
2. 5. Elementary Sorting/1. Bubble Sort.mp478.64MB
3. 9. Binary Trees/17. Reviewing the Min:Max Pseudocode Part 2.mp476.67MB
4. 11. Depth and Breadth-First Search/11. Breadth-First Search Stack Trace.mp473MB
5. 1. Object Oriented JavaScript/4. Pseudoclassical JavaScript.mp472.94MB
6. 2. Stacks and Queues/1. Stacks.mp472.65MB
7. 1. Object Oriented JavaScript/1. Introduction.mp471.46MB
8. 7. Trees and Searching/5. Exercise - Implement a Linked List Solution.mp471.31MB
9. 6. Sorting Algorithms/11. Quick Sort Review Part 1.mp470.13MB
10. 6. Sorting Algorithms/12. Quick Sort Review Part 2.mp469MB
11. 3. Recursion/9. Recursive Multiplier Solution.mp466.5MB
12. 9. Binary Trees/14. Deleting Min:Max Nodes.mp463.19MB
13. 2. Stacks and Queues/6. Exercise - Creating Stacks and Queues Solution.mp462.89MB
14. 8. Reviewing Core Concepts/5. Review - Quick Sort Part 1.mp461.59MB
15. 8. Reviewing Core Concepts/10. Review - Trees Part 2.mp461.29MB
16. 3. Recursion/10. minStack Solution.mp460.27MB
17. 4. Time Complexity/3. Understanding Big-O.mp459.52MB
18. 9. Binary Trees/6. Pseudocoding the BST contains() Method.mp458.82MB
19. 12. Hash Tables/8. Next Steps.mp458.19MB
20. 6. Sorting Algorithms/6. Understanding the Qucik Sort Partition.mp456.23MB
21. 3. Recursion/6. Factorial with Recursion.mp456.04MB
22. 9. Binary Trees/7. Binary Search Tree Exercise Solution.mp456.02MB
23. 6. Sorting Algorithms/2. Pseudocoding the Merge Routine.mp455.92MB
24. 6. Sorting Algorithms/4. Time Complexity for Merge Sort.mp455.76MB
25. 4. Time Complexity/2. Calculating Time Complexity.mp455.58MB
26. 12. Hash Tables/3. Key Components of a Hash Table.mp455.53MB
27. 11. Depth and Breadth-First Search/5. Pseudocoding BFS.mp455.16MB
28. 9. Binary Trees/9. Pseudocoding In-Order Traversal Part 1.mp454MB
29. 4. Time Complexity/5. Calculating Big-O of Loops.mp453.34MB
30. 11. Depth and Breadth-First Search/8. DFS Graph Stack Trace Part 2.mp452.99MB
31. 3. Recursion/2. Tracing Recursive Execution.mp452.64MB
32. 10. Graphs and Paths/1. Graph Vocabulary and Representations.mp452.41MB
33. 11. Depth and Breadth-First Search/3. Pseudocoding DFS Part 2.mp452.4MB
34. 6. Sorting Algorithms/10. Debugging the Quick Sort Algorithm.mp452.07MB
35. 6. Sorting Algorithms/3. Pseudocoding the Merge Sort.mp451.95MB
36. 1. Object Oriented JavaScript/5. Defining a Class.mp451.36MB
37. 9. Binary Trees/4. BST Search Procedure.mp450.68MB
38. 9. Binary Trees/8. In-Order Traversal.mp449.91MB
39. 8. Reviewing Core Concepts/8. Review - Linked Lists.mp449.12MB
40. 9. Binary Trees/10. Pseudocoding In-Order Traversal Part 2.mp448.93MB
41. 3. Recursion/8. Recursive Reverse Solution.mp447.57MB
42. 5. Elementary Sorting/3. Selection and Insertion Sort.mp447.28MB
43. 3. Recursion/4. Looping.mp446.95MB
44. 12. Hash Tables/2. Pseudocoding a Hashing Function.mp445.84MB
45. 9. Binary Trees/19. Deleting BST Nodes Solution Part 1.mp445.8MB
46. 7. Trees and Searching/3. Pseudocoding a Linked Lists.mp445.54MB
47. 10. Graphs and Paths/10. Implement a Graph Solution.mp444.56MB
48. 8. Reviewing Core Concepts/6. Review - Quick Sort Part 2.mp444.25MB
49. 9. Binary Trees/16. Reviewing the Min:Max Pseudocode Part 1.mp443.95MB
50. 6. Sorting Algorithms/8. Pseudocoding Quick Sort Part 2.mp442.03MB
51. 1. Object Oriented JavaScript/3. How to Succeed.mp440.61MB
52. 3. Recursion/11. Implementing a Queue with Two Stacks Solution.mp440.08MB
53. 9. Binary Trees/22. Deleting Two Children Solution.mp440.07MB
54. 2. Stacks and Queues/3. Implementing a Stack.mp439.92MB
55. 9. Binary Trees/15. Pseudocoding MIn:Max Deletion.mp439.14MB
56. 11. Depth and Breadth-First Search/10. Breadth-First Search Solution.mp439.01MB
57. 1. Object Oriented JavaScript/2. Agenda and Scope.mp438.63MB
58. 12. Hash Tables/4. Pseudocoding set(), get(), and remove().mp437.21MB
59. 12. Hash Tables/7. Implementing a Hash Table Solution.mp436.92MB
60. 8. Reviewing Core Concepts/1. Review - Time Complexity.mp436.86MB
61. 9. Binary Trees/11. Pre-Order Traversal.mp436.37MB
62. 7. Trees and Searching/2. Linked Lists.mp435.66MB
63. 9. Binary Trees/13. Initial Time Complexity for a BST.mp435.31MB
64. 10. Graphs and Paths/3. Pseudocoding the addNode() Method.mp435.17MB
65. 11. Depth and Breadth-First Search/7. DFS Graph Stack Trace Part 1.mp435.08MB
66. 9. Binary Trees/3. Pseudocoding a Binary Search Tree.mp434.59MB
67. 8. Reviewing Core Concepts/9. Review - Trees Part 1.mp434.58MB
68. 8. Reviewing Core Concepts/2. Review - Elementary Sorting.mp434.39MB
69. 9. Binary Trees/20. Deleting BST Nodes Solution Part 2.mp434MB
70. 12. Hash Tables/1. Hash Tables.mp433.66MB
71. 4. Time Complexity/4. Calculating Big-O of JS Operations.mp433.23MB
72. 8. Reviewing Core Concepts/4. Review - Merge Sort.mp433.02MB
73. 10. Graphs and Paths/6. Adding Nodes and Edges Solution.mp432.81MB
74. 2. Stacks and Queues/2. Stacks Interface.mp431.84MB
75. 11. Depth and Breadth-First Search/2. Pseudocoding DFS Part 1.mp431.49MB
76. 6. Sorting Algorithms/9. Reviewing the Pseudocode.mp430.99MB
77. 4. Time Complexity/1. Space vs Time Complexity.mp430.91MB
78. 9. Binary Trees/1. Binary Search Tree Overview.mp430.07MB
79. 12. Hash Tables/5. Handling Collisions.mp429.42MB
80. 8. Reviewing Core Concepts/7. Review - Stacks and Queues.mp428.07MB
81. 6. Sorting Algorithms/1. Merge Sort.mp427.66MB
82. 11. Depth and Breadth-First Search/6. Depth-First Search with a Graph Solution.mp426.41MB
83. 6. Sorting Algorithms/7. Pseudocoding Quick Sort Part 1.mp425.59MB
84. 10. Graphs and Paths/4. Pseudocoding the addEdges() Method.mp424.81MB
85. 11. Depth and Breadth-First Search/4. Breadth-First Search.mp424.37MB
86. 7. Trees and Searching/6. Implementing a Tree.mp423.62MB
87. 9. Binary Trees/12. Post-Order Traversal.mp422.92MB
88. 11. Depth and Breadth-First Search/9. Depth-First Search with a tree Solution.mp421.77MB
89. 9. Binary Trees/21. Exercise Deleting Two Children.mp421.3MB
90. 9. Binary Trees/23. Analysis of Time Complexity.mp421.1MB
91. 5. Elementary Sorting/2. Stability and Adaptability.mp420.68MB
92. 3. Recursion/5. Factorial with Loop.mp420.6MB
93. 10. Graphs and Paths/2. Pseudocoding the Matrix Constructor.mp420.07MB
94. 9. Binary Trees/15. BST Review.mp419.91MB
95. 6. Sorting Algorithms/5. Quick Sort Overview.mp418.99MB
96. 1. Object Oriented JavaScript/8. Creating a Constructor Solution.mp418.15MB
97. 7. Trees and Searching/1. Trees.mp417.37MB
98. 3. Recursion/7. Exercise - Recursion Interview Questions.mp417.28MB
99. 2. Stacks and Queues/4. Queues.mp416.89MB
100. 8. Reviewing Core Concepts/3. Review - Recursion.mp416.39MB
101. 3. Recursion/1. Why Recursion ?.mp415.65MB
102. 3. Recursion/3. Template for a Recursive Function.mp415.51MB
103. 10. Graphs and Paths/8. Pseudocoding an Adjacency List.mp414.34MB
104. 10. Graphs and Paths/7. Adjacency List.mp413.83MB
105. 5. Elementary Sorting/5. Bubble, Insertion, and Selection Sort Solution.mp413.78MB
106. 10. Graphs and Paths/5. Excercise - Adding Nodes and Edges.mp413.46MB
107. 4. Time Complexity/7. Calculating Time Complexity Solution.mp412.57MB
108. 11. Depth and Breadth-First Search/1. Graph Traversing and Depth-First Search.mp411.79MB
109. 2. Stacks and Queues/5. Exercise - Creating Stacks and Queues.mp411.51MB
110. 1. Object Oriented JavaScript/6. Using a Class.mp48.52MB
111. 9. Binary Trees/18. Exercise - Deleting Single-Child Nodes.mp48.28MB
112. 10. Graphs and Paths/9. Excercise - Implement a Graph.mp44.76MB
113. 5. Elementary Sorting/4. Exercise - Bubble, Inspection and Selection Sort.mp44.32MB
114. 12. Hash Tables/6. Exercise - Implementing a Hash Table.mp43.47MB
115. 4. Time Complexity/6. Exercise - Calculating Time Complexity.mp43.4MB
116. 9. Binary Trees/2. Excercise - Binary Search Trees.mp42.62MB
117. 7. Trees and Searching/4. Exercise - Implement a Linked List.mp42.23MB
118. 1. Object Oriented JavaScript/7. Exercise - Creating a Constructor.mp41.71MB