Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Master Data Structure & Algorithms & Crack the Coding Interview, а также все другие курсы, прямо сейчас!
Премиум
  1. Урок 1. 00:06:27
    Why every developer needs to learn Data Structures & Algorithms
  2. Урок 2. 00:06:14
    Introduction to Data Structures
  3. Урок 3. 00:07:54
    Introduction to Algorithms
  4. Урок 4. 00:07:29
    How to MASTER Data Structures & Algorithms
  5. Урок 5. 00:10:41
    How to Solve Coding Problems - My 6-Step Framework
  6. Урок 6. 00:09:46
    Applying the framework: TwoSum
  7. Урок 7. 00:01:40
    What this Bonus Module is about
  8. Урок 8. 00:13:45
    1 - Writing Our First Python Program
  9. Урок 9. 00:11:49
    2 - Python variables (Building Block 1)
  10. Урок 10. 00:13:21
    3 - Errors (when things go wrong...)
  11. Урок 11. 00:12:28
    4 - Basic Python datatypes - (Building Block 2)
  12. Урок 12. 00:17:57
    5 - Basic Python datatypes 2
  13. Урок 13. 00:18:04
    6 - Making our datatypes more POWERFUL - Methods
  14. Урок 14. 00:23:23
    7 - Python Functions (Building Block 3)
  15. Урок 15. 00:17:01
    8 - The flow of a program (Building Block 4)
  16. Урок 16. 00:17:19
    9 - Compound data types
  17. Урок 17. 00:07:45
    11 - Error handling - how to prevent crashes...
  18. Урок 18. 00:16:35
    12 - Libraries - standing on the shoulders of giants
  19. Урок 19. 00:04:01
    Modeling the real world using code - Object-Oriented Programming Introduction
  20. Урок 20. 00:10:45
    OOP-1 - Classes & Objects - Let's make some cookies!
  21. Урок 21. 00:07:13
    OOP-2: Objects & Classes in Python - I have been lying to you..
  22. Урок 22. 00:05:50
    OOP-3: Creating our Own Classes
  23. Урок 23. 00:06:27
    OOP-4: Creating our Own Classes 2
  24. Урок 24. 00:10:43
    OOP-5: Private attributes & Properties: Creating Secrets (Advanced)
  25. Урок 25. 00:02:07
    Module Overview - How do developers analyze algorithms?
  26. Урок 26. 00:03:42
    Introduction to Efficiency
  27. Урок 27. 00:12:23
    Big O notation - What makes an algorithm "fast"?
  28. Урок 28. 00:08:02
    Good vs bad runtime - O(n) & O(n^2)
  29. Урок 29. 00:04:46
    Best runtime - O(1)
  30. Урок 30. 00:08:03
    Logarithmic & linearithmic time complexity:O(logn) & O(nlogn)
  31. Урок 31. 00:07:38
    (Advanced) Terrible Time Complexities! - O(2^n), O(n!) and beyond
  32. Урок 32. 00:04:24
    Multiple inputs
  33. Урок 33. 00:05:08
    Space complexity
  34. Урок 34. 00:06:44
    Data Structures Introduction
  35. Урок 35. 00:07:13
    The Computer's Memory
  36. Урок 36. 00:04:15
    Lists/Arrays 1
  37. Урок 37. 00:06:29
    Lists/Arrays 2 - Big O
  38. Урок 38. 00:05:56
    (advanced) Dynamic Lists & list memory allocation
  39. Урок 39. 00:04:44
    List Exercise 1 walkthrough
  40. Урок 40. 00:05:26
    List exercise 2 walkthrough
  41. Урок 41. 00:02:18
    Linked Lists Introduction - What is a Linked List?
  42. Урок 42. 00:11:06
    Linked Lists Implementation in Python 1
  43. Урок 43. 00:06:00
    Linked List implementation in Python 2
  44. Урок 44. 00:04:48
    Linked List Big O
  45. Урок 45. 00:03:11
    List vs Linked List
  46. Урок 46. 00:05:57
    Linked List Exercise 1: Reverse a Linked List
  47. Урок 47. 00:05:47
    Linked List Exercise 2: Palindrome
  48. Урок 48. 00:03:25
    Stacks & Queues Introduction
  49. Урок 49. 00:03:42
    Stacks & Queues in Memory
  50. Урок 50. 00:06:18
    Stack Implementation in Python
  51. Урок 51. 00:02:03
    Queue Implementation in Python
  52. Урок 52. 00:01:37
    Stacks Big O
  53. Урок 53. 00:01:50
    Queue Big O
  54. Урок 54. 00:07:57
    Stack exercise walkthrough
  55. Урок 55. 00:05:20
    Queue exercise walkthrough
  56. Урок 56. 00:03:24
    Trees Introduction
  57. Урок 57. 00:06:25
    Binary Search Trees
  58. Урок 58. 00:03:58
    Binary Search Tree Implementation 1 - Insertion
  59. Урок 59. 00:11:00
    Binary Search Tree Implementation 2 - Searching
  60. Урок 60. 00:01:39
    Binary Search Tree Implementation 3 - Deletion
  61. Урок 61. 00:04:08
    Heaps
  62. Урок 62. 00:13:57
    Heap Implementation 1
  63. Урок 63. 00:05:42
    Heap Implementation 2
  64. Урок 64. 00:04:38
    Graphs Introduction
  65. Урок 65. 00:05:41
    Undirected Graph Implementation
  66. Урок 66. 00:03:35
    Different Types of Graphs
  67. Урок 67. 00:02:02
    Directed Graph Implementation
  68. Урок 68. 00:01:31
    Weighted (Directed) Graph Implementation
  69. Урок 69. 00:03:42
    Hash Maps Introduction
  70. Урок 70. 00:08:15
    Hash Maps Behind the Scenes
  71. Урок 71. 00:02:56
    Hash Maps Big O
  72. Урок 72. 00:08:36
    Hash Map Implementation from First Principles
  73. Урок 73. 00:03:44
    Hash Map Exercise Walkthrough
  74. Урок 74. 00:03:56
    Algorithms introduction
  75. Урок 75. 00:12:00
    List Algorithms
  76. Урок 76. 00:02:44
    Recursion introduction
  77. Урок 77. 00:06:42
    The Call Stack & Stack Overflow
  78. Урок 78. 00:07:26
    How to use recursion (step-by-step)
  79. Урок 79. 00:05:52
    Recursion exercise 1 walkthrough - Fibonacci
  80. Урок 80. 00:03:48
    Recursion exercise 2 walkthrough - Palindrome
  81. Урок 81. 00:05:32
    Recursive vs iterative programming
  82. Урок 82. 00:04:33
    Sorting introduction
  83. Урок 83. 00:04:41
    Insertion Sort
  84. Урок 84. 00:07:09
    Insertion Sort Implementation
  85. Урок 85. 00:03:11
    Bubble Sort
  86. Урок 86. 00:03:54
    Bubble Sort Implementation
  87. Урок 87. 00:08:10
    Merge Sort
  88. Урок 88. 00:10:56
    Merge Sort Implementation
  89. Урок 89. 00:05:12
    Quick Sort
  90. Урок 90. 00:06:13
    Quick Sort Implementation
  91. Урок 91. 00:03:40
    Which sorting algorithm should you use?
  92. Урок 92. 00:02:06
    Graph Searching Introduction
  93. Урок 93. 00:08:18
    Breadth-First Search (BFS)
  94. Урок 94. 00:07:20
    BFS Implementation
  95. Урок 95. 00:01:47
    Depth-First Search (DFS)
  96. Урок 96. 00:06:37
    DFS Implementation
  97. Урок 97. 00:03:57
    DFS vs BFS
  98. Урок 98. 00:07:44
    Dijkstra's Algorithm
  99. Урок 99. 00:05:50
    Dijkstra's Algorithm Implementation
  100. Урок 100. 00:06:26
    Dynamic Programming Introduction
  101. Урок 101. 00:03:31
    Dynamic programming exercise walkthrough: Fibonacci
  102. Урок 102. 00:04:47
    When To Use Dynamic Programming? (My Framework)
  103. Урок 103. 00:04:04
    Dynamic programming practical examples from my startup
  104. Урок 104. 00:05:13
    Two Pointers
  105. Урок 105. 00:05:52
    Two Pointers 2
  106. Урок 106. 00:10:39
    Two Pointers 3
  107. Урок 107. 00:03:03
    Sliding Window
  108. Урок 108. 00:06:36
    Sliding Window 2
  109. Урок 109. 00:04:32
    Fast and Slow Pointers (Tortoise and Hare)
  110. Урок 110. 00:04:00
    Fast and Slow Pointers 2
  111. Урок 111. 00:03:04
    Fast and Slow Pointers 3
  112. Урок 112. 00:05:31
    Backtracking
  113. Урок 113. 00:08:54
    Backtracking 2
  114. Урок 114. 00:09:54
    Divide and Conquer
  115. Урок 115. 00:07:23
    Divide and Conquer 2
  116. Урок 116. 00:03:20
    Prefix sum
  117. Урок 117. 00:06:43
    Prefix sum 2
  118. Урок 118. 00:06:43
    Prefix sum 3
  119. Урок 119. 00:02:42
    Note on this module
  120. Урок 120. 00:07:28
    How to Apply for Jobs and Get More Interviews
  121. Урок 121. 00:07:02
    How to Leverage LinkedIn to Get Interviews
  122. Урок 122. 00:12:49
    The Top Non-Technical Skills to get Hired
  123. Урок 123. 00:11:26
    How to Crack the Coding Interview