1. Урок 1.00:07:44
    Curriculum Walkthrough
  2. Урок 2.00:02:53
    What Order Should You Watch In?
  3. Урок 3.00:03:22
    How I'm Running My Code
  4. Урок 4.00:07:42
    Intro to Big O
  5. Урок 5.00:10:20
    Timing Our Code
  6. Урок 6.00:04:37
    Counting Operations
  7. Урок 7.00:04:26
    Visualizing Time Complexities
  8. Урок 8.00:09:59
    Official Intro to Big O
  9. Урок 9.00:09:33
    Simplifying Big O Expressions
  10. Урок 10.00:06:27
    Space Complexity
  11. Урок 11.00:08:47
    Logs and Section Recap
  12. Урок 12.00:01:43
    Section Introduction
  13. Урок 13.00:05:32
    The BIG O of Objects
  14. Урок 14.00:06:26
    When are Arrays Slow?
  15. Урок 15.00:05:57
    Big O of Array Methods
  16. Урок 16.00:07:09
    Introduction to Problem Solving
  17. Урок 17.00:08:00
    Step 1: Understand The Problem
  18. Урок 18.00:06:20
    Step 2: Concrete Examples
  19. Урок 19.00:07:45
    Step 3: Break It Down
  20. Урок 20.00:10:33
    Step 4: Solve Or Simplify
  21. Урок 21.00:16:58
    Step 5: Look Back and Refactor
  22. Урок 22.00:04:13
    Recap and Interview Strategies
  23. Урок 23.00:02:56
    Intro to Problem Solving Patterns
  24. Урок 24.00:15:12
    Frequency Counter Pattern
  25. Урок 25.00:02:34
    Frequency Counter: Anagram Challenge
  26. Урок 26.00:06:19
    Anagram Challenge Solution
  27. Урок 27.00:09:43
    Multiple Pointers Pattern
  28. Урок 28.00:04:30
    Multiple Pointers: Count Unique Values Challenge
  29. Урок 29.00:06:31
    Count Unique Values Solution
  30. Урок 30.00:13:15
    Sliding Window Pattern
  31. Урок 31.00:07:03
    Divide And Conquer Pattern
  32. Урок 32.00:07:07
    Story Time: Martin & The Dragon
  33. Урок 33.00:05:54
    Why Use Recursion?
  34. Урок 34.00:07:08
    The Call Stack
  35. Урок 35.00:05:12
    Our First Recursive Function
  36. Урок 36.00:07:55
    Our Second Recursive Function
  37. Урок 37.00:02:20
    Writing Factorial Iteratively
  38. Урок 38.00:03:16
    Writing Factorial Recursively
  39. Урок 39.00:05:07
    Common Recursion Pitfalls
  40. Урок 40.00:06:24
    Helper Method Recursion
  41. Урок 41.00:07:46
    Pure Recursion
  42. Урок 42.00:04:05
    Intro to Searching
  43. Урок 43.00:04:48
    Intro to Linear Search
  44. Урок 44.00:05:19
    Linear Search Solution
  45. Урок 45.00:01:56
    Linear Search BIG O
  46. Урок 46.00:05:48
    Intro to Binary Search
  47. Урок 47.00:02:41
    Binary Search PseudoCode
  48. Урок 48.00:16:42
    Binary Search Solution
  49. Урок 49.00:06:10
    Binary Search BIG O
  50. Урок 50.00:04:39
    Naive String Search
  51. Урок 51.00:12:30
    Naive String Search Implementation
  52. Урок 52.00:08:36
    Introduction to Sorting Algorithms
  53. Урок 53.00:04:41
    Built-In JavaScript Sorting
  54. Урок 54.00:07:22
    Bubble Sort: Overview
  55. Урок 55.00:09:59
    Bubble Sort: Implementation
  56. Урок 56.00:04:23
    Bubble Sort: Optimization
  57. Урок 57.00:01:29
    Bubble Sort: BIG O Complexity
  58. Урок 58.00:06:19
    Selection Sort: Introduction
  59. Урок 59.00:11:15
    Selection Sort: Implementation
  60. Урок 60.00:01:41
    Selection Sort: Big O Complexity
  61. Урок 61.00:03:18
    Insertion Sort: Introduction
  62. Урок 62.00:10:43
    Insertion Sort: Implementation
  63. Урок 63.00:02:25
    Insertion Sort: BIG O Complexity
  64. Урок 64.00:05:34
    Comparing Bubble, Selection, and Insertion Sort
  65. Урок 65.00:06:06
    Intro to the "Crazier" Sorts
  66. Урок 66.00:05:26
    Merge Sort: Introduction
  67. Урок 67.00:05:12
    Merging Arrays Intro
  68. Урок 68.00:06:56
    Merging Arrays: Implementation
  69. Урок 69.00:02:22
    Writing Merge Sort Part 1
  70. Урок 70.00:12:38
    Writing Merge Sort Part 2
  71. Урок 71.00:06:23
    Merge Sort BIG O Complexity
  72. Урок 72.00:09:01
    Introduction to Quick Sort
  73. Урок 73.00:08:07
    Pivot Helper Introduction
  74. Урок 74.00:08:09
    Pivot Helper Implementation
  75. Урок 75.00:08:47
    Quick Sort Implementation
  76. Урок 76.00:04:16
    Quick Sort Call Stack Walkthrough
  77. Урок 77.00:04:07
    Quick Sort Big O Complexity
  78. Урок 78.00:09:23
    Radix Sort: Introduction
  79. Урок 79.00:11:10
    Radix Sort: Helper Methods
  80. Урок 80.00:04:19
    Radix Sort: Pseudocode
  81. Урок 81.00:10:25
    Radix Sort: Implementation
  82. Урок 82.00:03:52
    Radix Sort: BIG O Complexity
  83. Урок 83.00:12:39
    Which Data Structure Is The Best?
  84. Урок 84.00:05:15
    ES2015 Class Syntax Overview
  85. Урок 85.00:06:37
    Data Structures: The Class Keyword
  86. Урок 86.00:09:50
    Data Structures: Adding Instance Methods
  87. Урок 87.00:07:12
    Data Structures: Adding Class Methods
  88. Урок 88.00:07:47
    Intro to Singly Linked Lists
  89. Урок 89.00:07:23
    Starter Code and Push Intro
  90. Урок 90.00:04:25
    Singly Linked List: Push Solution
  91. Урок 91.00:06:15
    Singly Linked List: Pop Intro
  92. Урок 92.00:07:36
    Singly Linked List: Pop Solution
  93. Урок 93.00:01:32
    Singly Linked List: Shift Intro
  94. Урок 94.00:03:23
    Singly Linked List: Shift Solution
  95. Урок 95.00:01:35
    Singly Linked List: Unshift Intro
  96. Урок 96.00:05:59
    Singly Linked List: Unshift Solution
  97. Урок 97.00:02:33
    Singly Linked List: Get Intro
  98. Урок 98.00:03:33
    Singly Linked List: Get Solution
  99. Урок 99.00:01:27
    Singly Linked List: Set Intro
  100. Урок 100.00:02:11
    Singly Linked List: Set Solution
  101. Урок 101.00:04:28
    Singly Linked List: Insert Intro
  102. Урок 102.00:07:50
    Singly Linked List: Insert Solution
  103. Урок 103.00:01:57
    Singly Linked List: Remove Intro
  104. Урок 104.00:03:16
    Singly Linked List: Remove Solution
  105. Урок 105.00:04:47
    Singly Linked List: Reverse Intro
  106. Урок 106.00:08:59
    Singly Linked List: Reverse Solution
  107. Урок 107.00:05:42
    Singly Linked List: BIG O Complexity
  108. Урок 108.00:04:44
    Doubly Linked Lists Introduction
  109. Урок 109.00:03:01
    Setting Up Our Node Class
  110. Урок 110.00:02:11
    Push
  111. Урок 111.00:04:05
    Push Solution
  112. Урок 112.00:03:21
    Pop
  113. Урок 113.00:06:24
    Pop Solution
  114. Урок 114.00:02:45
    Shift
  115. Урок 115.00:04:13
    Shift Solution
  116. Урок 116.00:01:37
    Unshift
  117. Урок 117.00:02:20
    Unshift Solution
  118. Урок 118.00:04:03
    Get
  119. Урок 119.00:07:05
    Get Solution
  120. Урок 120.00:01:19
    Set
  121. Урок 121.00:02:09
    Set Solution
  122. Урок 122.00:02:51
    Insert
  123. Урок 123.00:06:49
    Insert Solution
  124. Урок 124.00:02:19
    Remove
  125. Урок 125.00:06:29
    Remove Solution
  126. Урок 126.00:04:33
    Comparing Singly and Doubly Linked Lists
  127. Урок 127.00:06:20
    Intro to Stacks
  128. Урок 128.00:07:06
    Creating a Stack with an Array
  129. Урок 129.00:11:34
    Writing Our Own Stack From Scratch
  130. Урок 130.00:02:15
    BIG O of Stacks
  131. Урок 131.00:04:15
    Intro to Queues
  132. Урок 132.00:03:26
    Creating Queues Using Arrays
  133. Урок 133.00:10:25
    Writing Our Own Queue From Scratch
  134. Урок 134.00:02:31
    BIG O of Queues
  135. Урок 135.00:06:46
    Introduction to Trees
  136. Урок 136.00:06:33
    Uses For Trees
  137. Урок 137.00:05:55
    Intro to Binary Trees
  138. Урок 138.00:01:14
    POP QUIZ!
  139. Урок 139.00:02:56
    Searching A Binary Search Tree
  140. Урок 140.00:02:45
    Our Tree Classes
  141. Урок 141.00:03:51
    BST: Insert
  142. Урок 142.00:11:54
    BST: Insert Solution
  143. Урок 143.00:04:43
    BST: Find
  144. Урок 144.00:05:37
    BST: Find Solution
  145. Урок 145.00:05:59
    Big O of Binary Search Trees
  146. Урок 146.00:04:51
    Intro To Tree Traversal
  147. Урок 147.00:05:52
    Breadth First Search Intro
  148. Урок 148.00:06:21
    Breadth First Search Solution
  149. Урок 149.00:05:38
    Depth First PreOrder Intro
  150. Урок 150.00:06:51
    Depth First PreOrder Solution
  151. Урок 151.00:04:03
    Depth First PostOrder Intro
  152. Урок 152.00:02:39
    Depth First PostOrder Solution
  153. Урок 153.00:02:08
    Depth First InOrder Intro
  154. Урок 154.00:02:33
    Depth First InOrder Solution
  155. Урок 155.00:07:38
    When to Use BFS and DFS
  156. Урок 156.00:07:31
    Intro to Heaps
  157. Урок 157.00:07:06
    Storing Heaps
  158. Урок 158.00:09:15
    Heap: Insert Intro
  159. Урок 159.00:10:52
    Heap: Insert Solution
  160. Урок 160.00:08:29
    Heap: ExtractMax Intro
  161. Урок 161.00:17:57
    Heap: ExtractMax Solution
  162. Урок 162.00:09:00
    Priority Queue Intro
  163. Урок 163.00:03:44
    Priority Queue Pseudocode
  164. Урок 164.00:09:22
    Priority Queue Solution
  165. Урок 165.00:08:55
    BIG O of Binary Heaps
  166. Урок 166.00:05:51
    Intro to Hash Tables
  167. Урок 167.00:04:33
    More About Hash Tables
  168. Урок 168.00:06:12
    Intro to Hash Functions
  169. Урок 169.00:08:28
    Writing Our First Hash Function
  170. Урок 170.00:07:11
    Improving Our Hash Function
  171. Урок 171.00:04:00
    Handling Collisions
  172. Урок 172.00:04:03
    Hash Table Set and Get
  173. Урок 173.00:05:15
    Hash Table Set Solution
  174. Урок 174.00:06:44
    Hash Table Get Solution
  175. Урок 175.00:01:42
    Hash Table Keys and Values
  176. Урок 176.00:08:44
    Hash Table Keys and Values Solution
  177. Урок 177.00:05:42
    Hash Table Big O Complexity
  178. Урок 178.00:03:51
    Intro to Graphs
  179. Урок 179.00:07:58
    Uses for Graphs
  180. Урок 180.00:08:49
    Types of Graphs
  181. Урок 181.00:03:58
    Storing Graphs: Adjacency Matrix
  182. Урок 182.00:02:30
    Storing Graphs: Adjacency List
  183. Урок 183.00:05:52
    Adjacency Matrix Vs. List BIG O
  184. Урок 184.00:02:11
    Add Vertex Intro
  185. Урок 185.00:02:55
    Add Vertex Solution
  186. Урок 186.00:02:33
    Add Edge Intro
  187. Урок 187.00:02:12
    Add Edge Solution
  188. Урок 188.00:01:36
    Remove Edge Intro
  189. Урок 189.00:02:42
    Remove Edge Solution
  190. Урок 190.00:02:36
    Remove Vertex Intro
  191. Урок 191.00:04:35
    Remove Vertex Solution
  192. Урок 192.00:08:39
    Intro to Graph Traversal
  193. Урок 193.00:08:31
    Depth First Graph Traversal
  194. Урок 194.00:07:28
    DFS Recursive Intro
  195. Урок 195.00:12:46
    DFS Recursive Solution
  196. Урок 196.00:03:38
    DFS Iterative Intro
  197. Урок 197.00:08:45
    DFS Iterative Solution
  198. Урок 198.00:03:00
    Breadth First Graph Traversal
  199. Урок 199.00:02:28
    BFS Intro
  200. Урок 200.00:08:10
    BFS Solution
  201. Урок 201.00:02:42
    Intro to Dijkstra's and Prerequisites
  202. Урок 202.00:09:01
    Who was Dijkstra and what is his Algorithm?
  203. Урок 203.00:05:21
    Writing a Weighted Graph
  204. Урок 204.00:16:27
    Walking through the Algorithm
  205. Урок 205.00:03:49
    Introducing Our Simple Priority Queue
  206. Урок 206.00:04:29
    Dijkstra's Pseudo-Code
  207. Урок 207.00:21:19
    Implementing Dijkstra's Algorithm
  208. Урок 208.00:01:53
    Upgrading the Priority Queue
  209. Урок 209.00:05:04
    Intro to Dynamic Programming
  210. Урок 210.00:06:00
    Overlapping Subproblems
  211. Урок 211.00:06:29
    Optimal Substructure
  212. Урок 212.00:06:44
    Writing A Recursive Solution
  213. Урок 213.00:04:12
    Time Complexity of Our Solution
  214. Урок 214.00:03:40
    The Problem With Our Solution
  215. Урок 215.00:09:01
    Enter Memoization!
  216. Урок 216.00:03:28
    Time Complexity of Memoized Solution
  217. Урок 217.00:07:00
    Tabulation: A Bottom Up Approach