• Урок 1. 00:05:05
    How To Succeed In This Course
  • Урок 2. 00:05:40
    Section Overview
  • Урок 3. 00:05:10
    Resume
  • Урок 4. 00:17:06
    Exercise: Resume Walkthrough
  • Урок 5. 00:02:38
    Resume Review
  • Урок 6. 00:15:04
    What If I Don't Have Enough Experience?
  • Урок 7. 00:08:23
    LinkedIn
  • Урок 8. 00:03:24
    Portfolio
  • Урок 9. 00:08:25
    Email
  • Урок 10. 00:06:03
    Where To Find Jobs?
  • Урок 11. 00:03:35
    When Should You Start Applying?
  • Урок 12. 00:02:18
    Section Summary
  • Урок 13. 00:02:54
    Setting Up Your Environment
  • Урок 14. 00:02:25
    Section Overview
  • Урок 15. 00:06:58
    What Is Good Code?
  • Урок 16. 00:11:09
    Big O and Scalability
  • Урок 17. 00:05:40
    O(n)
  • Урок 18. 00:06:11
    O(1)
  • Урок 19. 00:05:55
    Solution: Big O Calculation
  • Урок 20. 00:02:30
    Solution: Big O Calculation 2
  • Урок 21. 00:01:51
    Simplifying Big O
  • Урок 22. 00:04:29
    Big O Rule 1
  • Урок 23. 00:06:37
    Big O Rule 2
  • Урок 24. 00:03:14
    Big O Rule 3
  • Урок 25. 00:07:14
    O(n^2)
  • Урок 26. 00:06:48
    Big O Rule 4
  • Урок 27. 00:03:19
    Big O Cheat Sheet
  • Урок 28. 00:05:33
    What Does This All Mean?
  • Урок 29. 00:01:19
    O(n!)
  • Урок 30. 00:03:33
    3 Pillars Of Programming
  • Урок 31. 00:02:23
    Space Complexity
  • Урок 32. 00:06:25
    Exercise: Space Complexity
  • Урок 33. 00:07:14
    Exercise: Twitter
  • Урок 34. 00:03:28
    Optional: Javascript Loops
  • Урок 35. 00:04:44
    Section Summary
  • Урок 36. 00:05:05
    Section Overview
  • Урок 37. 00:03:06
    What Are Companies Looking For?
  • Урок 38. 00:03:28
    What We Need For Coding Interviews
  • Урок 39. 00:02:32
    Exercise: Google Interview
  • Урок 40. 00:20:34
    Exercise: Interview Question
  • Урок 41. 00:23:00
    Exercise: Interview Question 2
  • Урок 42. 00:01:31
    Review Google Interview
  • Урок 43. 00:03:36
    Section Summary
  • Урок 44. 00:01:59
    Section Overview
  • Урок 45. 00:05:54
    What Is A Data Structure?
  • Урок 46. 00:12:34
    How Computers Store Data
  • Урок 47. 00:03:28
    Data Structures In Different Languages
  • Урок 48. 00:03:06
    Operations On Data Structures
  • Урок 49. 00:13:52
    Arrays Introduction
  • Урок 50. 00:06:41
    Static vs Dynamic Arrays
  • Урок 51. 00:24:52
    Optional: Classes In Javascript
  • Урок 52. 00:17:20
    Implementing An Array
  • Урок 53. 00:01:05
    Strings and Arrays
  • Урок 54. 00:01:36
    Exercise: Reverse A String
  • Урок 55. 00:10:32
    Solution: Reverse A String
  • Урок 56. 00:00:45
    Exercise: Merge Sorted Arrays
  • Урок 57. 00:14:13
    Solution: Merge Sorted Arrays
  • Урок 58. 00:03:29
    Arrays Review
  • Урок 59. 00:04:11
    Hash Tables Introduction
  • Урок 60. 00:05:57
    Hash Function
  • Урок 61. 00:09:44
    Hash Collisions
  • Урок 62. 00:03:31
    Hash Tables In Different Languages
  • Урок 63. 00:03:52
    Exercise: Implement A Hash Table
  • Урок 64. 00:17:25
    Solution: Implement A Hash Table
  • Урок 65. 00:06:12
    keys()
  • Урок 66. 00:02:02
    Hash Tables VS Arrays
  • Урок 67. 00:01:19
    Exercise: First Recurring Character
  • Урок 68. 00:16:12
    Solution: First Recurring Character
  • Урок 69. 00:06:10
    Hash Tables Review
  • Урок 70. 00:02:27
    Linked Lists Introduction
  • Урок 71. 00:04:37
    What Is A Linked List?
  • Урок 72. 00:02:06
    Exercise: Why Linked Lists?
  • Урок 73. 00:05:36
    Solution: Why Linked Lists?
  • Урок 74. 00:05:46
    What Is A Pointer?
  • Урок 75. 00:08:39
    Our First Linked List
  • Урок 76. 00:05:26
    Solution: append()
  • Урок 77. 00:02:28
    Solution: prepend()
  • Урок 78. 00:02:41
    Node Class
  • Урок 79. 00:05:13
    insert()
  • Урок 80. 00:13:09
    Solution: insert()
  • Урок 81. 00:05:22
    Solution: remove()
  • Урок 82. 00:03:19
    Doubly Linked Lists
  • Урок 83. 00:08:51
    Solution: Doubly Linked Lists
  • Урок 84. 00:02:41
    Singly VS Doubly Linked Lists
  • Урок 85. 00:01:31
    Exercise: reverse()
  • Урок 86. 00:07:39
    Solution: reverse()
  • Урок 87. 00:05:08
    Linked Lists Review
  • Урок 88. 00:02:59
    Stacks + Queues Introduction
  • Урок 89. 00:03:29
    Stacks
  • Урок 90. 00:03:31
    Queues
  • Урок 91. 00:03:07
    Exercise: Stacks VS Queues
  • Урок 92. 00:03:40
    Solution: Stacks VS Queues
  • Урок 93. 00:24:13
    Optional: How Javascript Works
  • Урок 94. 00:02:24
    Exercise: Stack Implementation (Linked Lists)
  • Урок 95. 00:08:59
    Solution: Stack Implementation (Linked Lists)
  • Урок 96. 00:00:54
    Exercise: Stack Implementation (Array)
  • Урок 97. 00:03:57
    Solution: Stack Implementation (Array)
  • Урок 98. 00:01:49
    Exercise: Queue Implementation
  • Урок 99. 00:07:51
    Solution: Queue Implementation
  • Урок 100. 00:02:05
    Queues Using Stacks
  • Урок 101. 00:02:20
    Stacks + Queues Review
  • Урок 102. 00:06:24
    Trees Introduction
  • Урок 103. 00:05:46
    Binary Trees
  • Урок 104. 00:07:01
    O(log n)
  • Урок 105. 00:06:13
    Binary Search Trees
  • Урок 106. 00:03:43
    Balanced VS Unbalanced BST
  • Урок 107. 00:02:27
    BST Pros and Cons
  • Урок 108. 00:03:58
    Exercise: Binary Search Tree
  • Урок 109. 00:10:11
    Solution: insert()
  • Урок 110. 00:04:55
    Solution: lookup()
  • Урок 111. 00:02:29
    Bonus Exercise: remove()
  • Урок 112. 00:07:42
    Solution: remove()
  • Урок 113. 00:02:57
    AVL Trees + Red Black Trees
  • Урок 114. 00:05:37
    Binary Heaps
  • Урок 115. 00:01:09
    Quick Note on Heaps
  • Урок 116. 00:05:28
    Priority Queue
  • Урок 117. 00:03:17
    Trie
  • Урок 118. 00:00:52
    Tree Review
  • Урок 119. 00:02:29
    Graphs Introduction
  • Урок 120. 00:03:33
    Types Of Graphs
  • Урок 121. 00:02:46
    Exercise: Guess The Graph
  • Урок 122. 00:05:59
    Graph Data
  • Урок 123. 00:04:07
    Exercise: Graph Implementation
  • Урок 124. 00:04:51
    Solution: Graph Implementation
  • Урок 125. 00:02:05
    Graphs Review
  • Урок 126. 00:01:53
    Data Structures Review
  • Урок 127. 00:01:54
    What Else Is Coming Up?
  • Урок 128. 00:03:52
    Introduction to Algorithms
  • Урок 129. 00:05:37
    Recursion Introduction
  • Урок 130. 00:06:18
    Stack Overflow
  • Урок 131. 00:10:28
    Anatomy Of Recursion
  • Урок 132. 00:03:26
    Exercise: Factorial
  • Урок 133. 00:06:21
    Solution: Factorial
  • Урок 134. 00:02:00
    Exercise: Fibonacci
  • Урок 135. 00:11:22
    Solution: Fibonacci
  • Урок 136. 00:04:17
    Recursive VS Iterative
  • Урок 137. 00:04:01
    When To Use Recursion
  • Урок 138. 00:02:48
    Recursion Review
  • Урок 139. 00:07:02
    Sorting Introduction
  • Урок 140. 00:06:52
    The Issue With sort()
  • Урок 141. 00:03:39
    Sorting Algorithms
  • Урок 142. 00:03:46
    Bubble Sort
  • Урок 143. 00:05:07
    Solution: Bubble Sort
  • Урок 144. 00:02:40
    Selection Sort
  • Урок 145. 00:02:24
    Solution: Selection Sort
  • Урок 146. 00:01:37
    Dancing Algorithms
  • Урок 147. 00:02:39
    Insertion Sort
  • Урок 148. 00:02:07
    Solution: Insertion Sort
  • Урок 149. 00:09:00
    Merge Sort and O(n log n)
  • Урок 150. 00:04:45
    Solution: Merge Sort
  • Урок 151. 00:07:41
    Quick Sort
  • Урок 152. 00:04:41
    Which Sort Is Best?
  • Урок 153. 00:04:18
    Radix Sort + Counting Sort
  • Урок 154. 00:01:28
    Exercise: Sorting Interview
  • Урок 155. 00:07:08
    Solution: Sorting Interview
  • Урок 156. 00:01:28
    Sorting In Your Language
  • Урок 157. 00:02:54
    Sorting Review
  • Урок 158. 00:01:35
    Searching + Traversal Introduction
  • Урок 159. 00:03:38
    Linear Search
  • Урок 160. 00:06:06
    Binary Search
  • Урок 161. 00:03:57
    Graph + Tree Traversals
  • Урок 162. 00:02:46
    BFS Introduction
  • Урок 163. 00:03:24
    DFS Introduction
  • Урок 164. 00:03:21
    BFS vs DFS
  • Урок 165. 00:00:45
    Exercise: BFS vs DFS
  • Урок 166. 00:03:17
    Solution: BFS vs DFS
  • Урок 167. 00:09:16
    breadthFirstSearch()
  • Урок 168. 00:05:34
    breadthFirstSearchRecursive()
  • Урок 169. 00:05:22
    PreOrder, InOrder, PostOrder
  • Урок 170. 00:12:04
    depthFirstSearch()
  • Урок 171. 00:03:54
    Graph Traversals
  • Урок 172. 00:02:08
    BFS in Graphs
  • Урок 173. 00:02:50
    DFS in Graphs
  • Урок 174. 00:05:12
    Dijkstra + Bellman-Ford Algorithms
  • Урок 175. 00:04:22
    Searching + Traversal Review
  • Урок 176. 00:01:52
    Dynamic Programming Introduction
  • Урок 177. 00:07:48
    Memoization 1
  • Урок 178. 00:03:57
    Memoization 2
  • Урок 179. 00:05:34
    Fibonacci and Dynamic Programming
  • Урок 180. 00:05:48
    Dynamic Programming
  • Урок 181. 00:09:13
    Implementing Dynamic Programming
  • Урок 182. 00:04:46
    Dynamic Programming Review
  • Урок 183. 00:02:39
    Section Overview
  • Урок 184. 00:09:05
    During The Interview
  • Урок 185. 00:05:31
    Tell Me About Yourself
  • Урок 186. 00:05:07
    Why Us?
  • Урок 187. 00:05:19
    Tell Me About A Problem You Have Solved
  • Урок 188. 00:02:20
    What Is Your Biggest Weakness
  • Урок 189. 00:03:25
    Any Questions For Us?
  • Урок 190. 00:08:12
    Secret Weapon
  • Урок 191. 00:05:25
    After The Interview
  • Урок 192. 00:03:57
    Section Summary
  • Урок 193. 00:02:11
    Section Overview
  • Урок 194. 00:04:08
    Handling Rejection
  • Урок 195. 00:09:41
    Negotiation 101
  • Урок 196. 00:09:04
    Handling An Offer
  • Урок 197. 00:07:30
    Handling Multiple Offers
  • Урок 198. 00:07:42
    Getting A Raise
  • Урок 199. 00:02:10
    Section Summary
  • Урок 200. 00:00:53
    Thank You.
  • Урок 201. 00:01:26
    Coding Problems
  • Урок 202. 00:14:45
    Contributing To Open Source
  • Урок 203. 00:09:43
    Contributing To Open Source 2
  • Урок 204. 00:02:00
    From JTS: Learn to Learn
  • Урок 205. 00:02:44
    From JTS: Start With Why
  • Урок 206. 00:02:28
    How To Use Leetcode
  • Урок 207. 00:38:31
    AMA - 100,000 Students!!
Этот курс находится в платной подписке. Оформи премиум подписку и смотри Master the Coding Interview: Data Structures + Algorithms, а также все другие курсы, прямо сейчас!
Премиум