Это пробный урок. Оформите подписку, чтобы получить доступ ко всем материалам курса. Премиум

  1. Урок 1. 00:01:12
    Welcome to the Course!
  2. Урок 2. 00:04:59
    What are "Data Structures"?
  3. Урок 3. 00:08:58
    Arrays: Recap
  4. Урок 4. 00:05:47
    Sets: Recap
  5. Урок 5. 00:01:36
    Arrays vs Sets
  6. Урок 6. 00:07:06
    Objects: Recap
  7. Урок 7. 00:07:38
    Maps: Recap
  8. Урок 8. 00:01:44
    Objects vs Maps
  9. Урок 9. 00:02:17
    WeakSet and WeakMap
  10. Урок 10. 00:02:47
    Linked Lists (A First Custom Data Structures)
  11. Урок 11. 00:13:20
    Starting with Linked Lists and "append"
  12. Урок 12. 00:04:59
    Outputting the Linked List
  13. Урок 13. 00:04:10
    Prepend to Linked Lists
  14. Урок 14. 00:10:32
    Deleting Nodes
  15. Урок 15. 00:06:57
    "find" and "insertAfter"
  16. Урок 16. 00:05:29
    Linked Lists: Why and Time Complexity
  17. Урок 17. 00:07:07
    Linked Lists vs Arrays
  18. Урок 18. 00:00:56
    Module Introduction
  19. Урок 19. 00:04:23
    What are "Lists" and "Tables"?
  20. Урок 20. 00:03:43
    Built-in Lists and Tables
  21. Урок 21. 00:05:52
    Introducing "Stacks"
  22. Урок 22. 00:07:02
    Building a "Stack" Data Structure
  23. Урок 23. 00:02:42
    Considering a Linked List Stack
  24. Урок 24. 00:09:13
    Stacks with Linked Lists
  25. Урок 25. 00:04:51
    Stacks: Time Complexity
  26. Урок 26. 00:03:25
    Introducing Queues
  27. Урок 27. 00:04:35
    Building a Queue
  28. Урок 28. 00:05:10
    Linked Lists & Queues
  29. Урок 29. 00:04:46
    Queue Time Complexity
  30. Урок 30. 00:04:19
    Introducing Hash Tables
  31. Урок 31. 00:09:55
    Why we need Tables
  32. Урок 32. 00:12:21
    Building a Basic Hash Table
  33. Урок 33. 00:04:59
    Understanding Hash Collisions
  34. Урок 34. 00:11:52
    Solving Collisions with Chaining
  35. Урок 35. 00:10:43
    Solving Collisions with Open Addressing
  36. Урок 36. 00:07:05
    Hash Tables: Time Complexity
  37. Урок 37. 00:04:47
    Hash Tables: Summary
  38. Урок 38. 00:01:36
    Module Introduction
  39. Урок 39. 00:03:29
    What are "Trees"?
  40. Урок 40. 00:08:59
    Core Terminology
  41. Урок 41. 00:02:44
    An Example Tree
  42. Урок 42. 00:11:17
    A First Tree in Code
  43. Урок 43. 00:14:11
    A Better Filesystem Tree
  44. Урок 44. 00:07:07
    Removing Tree Nodes
  45. Урок 45. 00:06:50
    Describing Our Tree
  46. Урок 46. 00:04:43
    Trees: Time Complexity
  47. Урок 47. 00:02:22
    Depth-first vs Breadth-first Search
  48. Урок 48. 00:06:02
    Implementing Depth-first Search
  49. Урок 49. 00:03:28
    Implementing Breadth-first Search
  50. Урок 50. 00:05:07
    Depth-first Search vs Breadth-first Search
  51. Урок 51. 00:03:35
    Introducing Binary Search Trees (BST)
  52. Урок 52. 00:06:28
    Adding Values to BST
  53. Урок 53. 00:10:15
    Finding Values in BST
  54. Урок 54. 00:07:47
    Removing Leaf Nodes in BST
  55. Урок 55. 00:05:13
    Removing "One-Child" Nodes in BST
  56. Урок 56. 00:12:10
    Removing "Multi-Child" Nodes in BST
  57. Урок 57. 00:03:39
    BST Time Complexity
  58. Урок 58. 00:03:09
    Introducing AVL Trees
  59. Урок 59. 00:04:06
    Balancing Trees with Rotations
  60. Урок 60. 00:03:01
    Understanding Balance Factors
  61. Урок 61. 00:06:26
    Adding Depth and Balance Factors
  62. Урок 62. 00:08:08
    Finding the Right Rotation
  63. Урок 63. 00:09:51
    Implementing Left Rotation
  64. Урок 64. 00:03:22
    Implementing Right Rotation
  65. Урок 65. 00:08:11
    Implementing Left-Right Rotation
  66. Урок 66. 00:03:29
    Implementing Right-Left Rotation
  67. Урок 67. 00:03:07
    Testing the AVL Tree
  68. Урок 68. 00:01:06
    AVL vs BST
  69. Урок 69. 00:03:36
    Introducing Tries
  70. Урок 70. 00:12:02
    Building a Trie
  71. Урок 71. 00:03:25
    Finding Nodes in a Trie
  72. Урок 72. 00:03:58
    Deleting Keys
  73. Урок 73. 00:05:42
    Tries: Time Complexity and Comparison to Hash Tables
  74. Урок 74. 00:00:38
    Module Introduction
  75. Урок 75. 00:02:04
    Understanding Priority Queues
  76. Урок 76. 00:04:23
    Building a Regular Queue
  77. Урок 77. 00:07:34
    Building a Basic Priority Queue
  78. Урок 78. 00:02:08
    Priority Queues & Time Complexity
  79. Урок 79. 00:03:23
    Introducing Heaps
  80. Урок 80. 00:05:51
    Exploring the Heap Concept
  81. Урок 81. 00:11:21
    Building a Heap
  82. Урок 82. 00:11:52
    Processing Items
  83. Урок 83. 00:04:35
    A Heap-based Priority Queue
  84. Урок 84. 00:05:54
    Heaps & Time Complexity
  85. Урок 85. 00:00:38
    Module Introduction
  86. Урок 86. 00:06:02
    Graphs: What and Why?
  87. Урок 87. 00:09:57
    Graphs with an Adjacency Matrix
  88. Урок 88. 00:04:28
    Using Adjacency Lists Instead
  89. Урок 89. 00:05:45
    Adjacency Lists vs Matrices
  90. Урок 90. 00:07:07
    Building a Graph Structure
  91. Урок 91. 00:07:02
    Adding Graph Methods
  92. Урок 92. 00:10:48
    Removing Nodes & Edges
  93. Урок 93. 00:07:15
    Using Sets in Graphs
  94. Урок 94. 00:01:09
    Summary
  95. Урок 95. 00:05:54
    Building a Social Network Graph