Этот материал находится в платной подписке. Оформи премиум подписку и смотри или слушай Data Structures & Algorithms: Part 1, а также все другие курсы, прямо сейчас!
Премиум
  • Урок 1. 00:02:53
    Course Outline
  • Урок 2. 00:00:25
    Introduction
  • Урок 3. 00:01:59
    What is Big O
  • Урок 4. 00:01:30
    O(1)
  • Урок 5. 00:03:45
    O(n)
  • Урок 6. 00:02:25
    O(n^2)
  • Урок 7. 00:02:40
    O(log n)
  • Урок 8. 00:00:51
    O(2^n)
  • Урок 9. 00:02:33
    Space Complexity
  • Урок 10. 00:00:45
    Introduction
  • Урок 11. 00:03:09
    Understanding Arrays
  • Урок 12. 00:03:30
    Working with Arrays in Java
  • Урок 13. 00:02:52
    Exercise- Array Class
  • Урок 14. 00:03:20
    Solution- Creating the Class
  • Урок 15. 00:04:20
    Solution- insert()
  • Урок 16. 00:04:52
    Solution- removeAt()
  • Урок 17. 00:02:29
    Solution- indexOf()
  • Урок 18. 00:03:49
    Dynamic Arrays
  • Урок 19. 00:01:10
    Summary
  • Урок 20. 00:00:37
    Introduction
  • Урок 21. 00:04:34
    What are Linked Lists
  • Урок 22. 00:03:25
    Working with Linked Lists
  • Урок 23. 00:01:26
    Exercise- Building a Linked List
  • Урок 24. 00:06:10
    Solution- addLast
  • Урок 25. 00:02:14
    Solution- addFirst
  • Урок 26. 00:01:55
    Solution- indexOf
  • Урок 27. 00:01:06
    Solution- contains
  • Урок 28. 00:04:24
    Solution- removeFirst
  • Урок 29. 00:04:41
    Solution- removeLast
  • Урок 30. 00:04:16
    Implementing size()
  • Урок 31. 00:02:11
    Converting Linked Lists to Arrays
  • Урок 32. 00:01:13
    Cheat Sheets
  • Урок 33. 00:03:22
    Arrays vs Linked Lists
  • Урок 34. 00:03:15
    Types of Linked Lists
  • Урок 35. 00:01:34
    Exercise- Reversing a Linked List
  • Урок 36. 00:09:01
    Solution- Reversing a Linked List
  • Урок 37. 00:03:21
    Exercise- Kth Node from the End
  • Урок 38. 00:05:23
    Solution- Kth Node from the End
  • Урок 39. 00:01:13
    Summary
  • Урок 40. 00:00:32
    Introduction
  • Урок 41. 00:02:48
    What are Stacks
  • Урок 42. 00:02:22
    Working with Stacks
  • Урок 43. 00:00:42
    Exercise- Reversing a String
  • Урок 44. 00:05:02
    Solution - Reversing a String
  • Урок 45. 00:02:55
    Exercise- Balanced Expressions
  • Урок 46. 00:05:18
    Solution- A Basic Implementation
  • Урок 47. 00:03:37
    Solution- Supporting Other Brackets
  • Урок 48. 00:04:10
    Solution- First Refactoring
  • Урок 49. 00:05:51
    Solution- Second Refactoring
  • Урок 50. 00:00:48
    Exercise- Building a Stack Using an Array
  • Урок 51. 00:08:19
    Solution- Implementing a Stack Using an Array
  • Урок 52. 00:00:34
    Summary
  • Урок 53. 00:00:27
    Introduction
  • Урок 54. 00:02:05
    What are Queues
  • Урок 55. 00:05:13
    Queues in Java
  • Урок 56. 00:01:07
    Exercise- Reversing a Queue
  • Урок 57. 00:02:18
    Solution- Reversing a Queue
  • Урок 58. 00:02:04
    Exercise- Building a Queue Using an Array
  • Урок 59. 00:06:33
    Solution- A Basic Implementation
  • Урок 60. 00:05:55
    Solution- Circular Arrays
  • Урок 61. 00:00:56
    Exercise- Implementing a Queue Using a Stack
  • Урок 62. 00:07:44
    Solution- Building a Queue Using a Stack
  • Урок 63. 00:01:54
    Priority Queues
  • Урок 64. 00:03:58
    Exercise- Building a Priority Queue
  • Урок 65. 00:08:52
    Solution- Building a Priority Queue
  • Урок 66. 00:03:03
    Solution- Refactoring
  • Урок 67. 00:00:58
    Summary
  • Урок 68. 00:00:27
    Introduction
  • Урок 69. 00:02:45
    What are Hash Tables
  • Урок 70. 00:06:07
    Working with Hash Tables
  • Урок 71. 00:00:55
    Exercise- Find the First Non-repeated Character
  • Урок 72. 00:07:40
    Solution- First Non-repeating Character
  • Урок 73. 00:02:24
    Sets
  • Урок 74. 00:00:33
    Exercise- First Repeated Character
  • Урок 75. 00:02:37
    Solution- First Repeated Character
  • Урок 76. 00:05:56
    Hash Functions
  • Урок 77. 00:01:07
    Collisions
  • Урок 78. 00:01:41
    Chaining
  • Урок 79. 00:02:42
    Open Addressing- Linear Probing
  • Урок 80. 00:01:30
    Open Addressing- Quadratic Probing
  • Урок 81. 00:03:20
    Open Addressing- Double Hashing
  • Урок 82. 00:02:37
    Exercise- Build a HashTable
  • Урок 83. 00:06:08
    Solution- put()
  • Урок 84. 00:04:30
    Solution- get()
  • Урок 85. 00:02:31
    Solution- remove()
  • Урок 86. 00:11:05
    Solution- Refactoring
  • Урок 87. 00:01:26
    Summary
  • Урок 88. 00:00:33
    Course Wrap Up